Dominance guarantees for above-average solutions

DOI10.1016/j.disopt.2007.11.009zbMath1140.90482OpenAlexW2069847328MaRDI QIDQ937396

Yochai Twitto

Publication date: 15 August 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.11.009

zbMATH Keywords

combinatorial optimizationanalysis of algorithmsapproximation algorithmsdomination analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ Unnamed Item ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for combinatorial problems
• Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
• Domination analysis of combinatorial optimization problems.
• Domination analysis of greedy heuristics for the frequency assignment problem.
• A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
• Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
• Domination analysis of some heuristics for the traveling salesman problem
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
• Algorithms with large domination ratio
• Algorithms and Data Structures
• TSP tour domination and Hamilton cycle decompositions of regular digraphs

This page was built for publication: Dominance guarantees for above-average solutions