[图书][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem
D Karapetyan, G Gutin - Evolutionary computation, 2011 - ieeexplore.ieee.org
Memetic algorithms are known to be a powerful technique in solving hard optimization
problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting …
problems. To design a memetic algorithm, one needs to make a host of decisions. Selecting …
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
G Gutin, B Goldengorin, J Huang - International Workshop on …, 2006 - Springer
Optimization heuristics are often compared with each other to determine which one performs
best by means of worst-case performance ratio reflecting the quality of returned solution in …
best by means of worst-case performance ratio reflecting the quality of returned solution in …
Local search heuristics for the multidimensional assignment problem
D Karapetyan, G Gutin - Journal of Heuristics, 2011 - Springer
Abstract The Multidimensional Assignment Problem (MAP)(abbreviated s-AP in the case of s
dimensions) is an extension of the well-known assignment problem. The most studied case …
dimensions) is an extension of the well-known assignment problem. The most studied case …
A backbone based TSP heuristic for large instances
We introduce a reduction technique for large instances of the traveling salesman problem
(TSP). This approach is based on the observation that tours with good quality are likely to …
(TSP). This approach is based on the observation that tours with good quality are likely to …
Empirical evaluation of construction heuristics for the multidimensional assignment problem
The multidimensional assignment problem (MAP)(abbreviated s-AP in the case of s
dimensions) is an extension of the well-known assignment problem. The most studied case …
dimensions) is an extension of the well-known assignment problem. The most studied case …
Dominating induced matchings
DM Cardoso, VV Lozin - … Intelligence and Thought: Essays Dedicated to …, 2009 - Springer
We study the problem of determining whether or not a graph G has an induced matching that
dominates every edge of the graph, which is also known as efficient edge domination. This …
dominates every edge of the graph, which is also known as efficient edge domination. This …
Learning Heuristics for Combinatorial Optimization Problems on K-Partite Hypergraphs
Recently, deep neural networks have demonstrated remarkable performance in addressing
combinatorial optimization challenges. The expressive power of graph neural networks …
combinatorial optimization challenges. The expressive power of graph neural networks …
Local search heuristics for the multidimensional assignment problem
G Gutin, D Karapetyan - … Intelligence and Thought: Essays Dedicated to …, 2009 - Springer
Abstract The Multidimensional Assignment Problem (MAP)(abbreviated s-AP in the case of s
dimensions) is an extension of the well-known assignment problem. The most studied case …
dimensions) is an extension of the well-known assignment problem. The most studied case …
A memetic algorithm for the multidimensional assignment problem
G Gutin, D Karapetyan - … , SLS 2009, Brussels, Belgium, September 3-4 …, 2009 - Springer
Abstract The Multidimensional Assignment Problem (MAP or s-AP in the case of s
dimensions) is an extension of the well-known assignment problem. The most studied case …
dimensions) is an extension of the well-known assignment problem. The most studied case …