Results 31 to 40 of about 8,140,957 (328)

Minimum Entropy Combinatorial Optimization Problems [PDF]

Theory of Computing Systems, 2009
We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.
Cardinal, Jean, Fiorini, Samuel, Joret, Gwenaël   +2 more
openaire   +7 more sources

Reinforcement Learning for Combinatorial Optimization: A Survey [PDF]

Computers & Operations Research, 2020
Combinatorial optimization (CO) is the workhorse of numerous important applications in operations research, engineering, and other fields and, thus, has been attracting enormous attention from the research community recently. Some efficient approaches to
Nina Mazyavkina, S. Sviridov, S. Ivanov, Evgeny Burnaev   +3 more
semanticscholar   +1 more source

Optimization heuristics for the combinatorial auction problem [PDF]

The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004
This work presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer.
Michael Schwind, Tim Stockheim, Franz Rothlauf   +2 more
openaire   +3 more sources

The Minmax Multidimensional Knapsack Problem with Application to a Chance-Constrained Problem [PDF]

, 2007
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two-period, two-level, chanced-constrained problem with recourse.
Polukarov, Maria, Michal Penn, Maria Polukarov, Penn, Michael, Kress, Moshe, Moshe Kress, Penn, Michal   +6 more
core   +2 more sources

A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]

, 2006
We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N., Chronicle, Edward P., Ormerod, ThomasC.   +2 more
core   +5 more sources

Quantum annealing for combinatorial optimization: a benchmarking study [PDF]

npj Quantum Information
Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods.
Seongmin Kim, Sang-Woo Ahn, In-Saeng Suh, A. Dowling, Eungkyu Lee, Tengfei Luo   +5 more
semanticscholar   +1 more source

Multi-Objective ABC-NM Algorithm for Multi-Dimensional Combinatorial Optimization Problem

Axioms, 2023
This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail to ...
Muniyan Rajeswari, Rajakumar Ramalingam, Shakila Basheer, Keerthi Samhitha Babu, Mamoon Rashid, Ramar Saranya   +5 more
doaj   +1 more source

Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development

Applied Sciences, 2021
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in ...
Fernando Peres, M. Castelli
semanticscholar   +1 more source

Multi-objective Discrete Combinatorial Optimization Algorithm Combining Problem-Decomposition and Adaptive Large Neighborhood Search [PDF]

Jisuanji kexue yu tansuo
In order to efficiently obtain solutions for large-scale multi-objective optimization problems in reality, to achieve a balance among convergence, diversity, and uniformity has gradually become one of the important goals in multi-objective optimization ...
WEI Qian, JI Bin
doaj   +1 more source

Ranking of Search Requests in the Digital Information Retrieval System Based on Dynamic Neural Networks

Complexity, 2022
The article is devoted to the problem of optimization of search request ranking algorithms in the digital information retrieval system. The algorithm of functioning of the neural network ranking unit based on Hopfield neural network is built. The ability
Viera Bartosova, Svetlana Drobyazko, Sergii Bogachov, Olga Afanasieva, Maria Mikhailova   +4 more
doaj   +1 more source