Results 11 to 20 of about 6,800,360 (294)
Multimode extensions of Combinatorial Optimization problems [PDF]
Electronic Notes in Discrete Mathematics, 2016 We review some complexity results and present a viable heuristic approach based on the Variable Neighborhood Search (VNS) framework for multimode extension of combinatorial optimization problems, such as the the Set Covering Problem (SCP) and the Covering Location Problem (CLP).
Cordone, R., Lulli, G.
openaire +3 more sources
Approximating Incremental Combinatorial Optimization Problems. [PDF]
, 2017 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps. We consider a natural algorithm of moving towards a global optimum solution as quickly as possible. We show that this algorithm
Goemans, Michel X, Unda, Francisco Tomas
openaire +6 more sources
Bird Mating Optimizer for Combinatorial Optimization Problems [PDF]
IEEE Access, 2020 The bird mating optimizer is a new metaheuristic algorithm that was originally proposed to solve continuous optimization problems with a very promising performance.
Anas Arram +3 more
doaj +2 more sources
The Power of Human–Algorithm Collaboration in Solving Combinatorial Optimization Problems
Algorithms, 2021 Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which—under standard assumptions in complexity theory—cannot be solved in sub-exponential time
Tapani Toivonen, Markku Tukiainen
doaj +2 more sources
The bandpass problem: combinatorial optimization and library of problems
Journal of Combinatorial Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Djangir A. Babayev +2 more
openaire +6 more sources
Enhanced Hyper-Cube Framework Ant Colony Optimization for Combinatorial Optimization Problems
Algorithms, 2021 Solving of combinatorial optimization problems is a common practice in real-life engineering applications. Trusses, cranes, and composite laminated structures are some good examples that fall under this category of optimization problems.
Ali Ahmid, Thien-My Dao, Ngan Van Le
doaj +2 more sources
A general ant colony model to solve combinatorial optimization problems [PDF]
Revista Colombiana de Computación, 2001 An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. Keywords: Combinatorial Optimization Problem,AntSystem, the Graph Partitioning and The Traveling Salesman Problems.
José Aguilar
doaj +2 more sources
Linear Assignment Problems in Combinatorial Optimization
, 2017 In this chapter we introduce the notion of a “pattern” in the Linear Assignment Problem and show that patterns may be useful to create new insights and approaches for many combinatorial optimization problems defined on a rectangular input matrix. We define a pattern as a specific collection of cells in the rectangular matrix reflecting the structure of
Goldengorin, Boris, Krushinsky, Dmitry
openaire +3 more sources
New techniques for cost sharing in combinatorial optimization games [PDF]
, 2010 Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
A. N. Letchford +3 more
core +4 more sources
On the Landscape of Combinatorial Optimization Problems [PDF]
IEEE Transactions on Evolutionary Computation, 2014 This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima.
Tayarani Najaran, Mohammad +1 more
openaire +3 more sources