Combinatorial dominance guarantees for heuristic algorithms

MaRDI QIDQ3576755zbMATH OpenFDO

Authors Daniel Berend, Yochai Twitto, Steven Skiena

Publication date 2 August 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAH0106/0.html

zbMATH Keywords

approximation algorithmscombinatorial optimizationdomination analysis contents 1 introduction 1

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Analysis of algorithms (68W40)

Recommendations

• Combinatorial dominance guarantees for problems with infeasible solutions
• Dominance certificates for combinatorial optimization problems
• A new dominance procedure for combinatorial optimization problems
• Dominance guarantees for above-average solutions
• Domination analysis of combinatorial optimization problems.

Cited in

(9)

• Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
• A new dominance procedure for combinatorial optimization problems
• Domination analysis of combinatorial optimization problems.
• Dominance certificates for combinatorial optimization problems
• scientific article; zbMATH DE number 5010630 (Why is no real title available?)
• Dominance rules in combinatorial optimization problems
• Combinatorial dominance guarantees for problems with infeasible solutions
• Domination analysis for minimum multiprocessor scheduling
• Dominance guarantees for above-average solutions

This page was built for publication: Combinatorial dominance guarantees for heuristic algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576755)