A note on the depth function of combinatorial optimization problems

DOI10.1016/S0166-218X(00)00242-0MaRDI QIDQ5929316zbMATH OpenOpenAlexFDO

Authors Gerhard J. Woeginger

Publication date 30 October 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(00)00242-0

zbMATH Keywords

computational complexitydiscrete optimization problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the depth of combinatorial optimization problems
• Complexity classes of optimization functions
• The complexity of optimization problems
• Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
• Improving known solutions is hard

Cites work

• Cooling Schedules for Optimal Annealing
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1082102 (Why is no real title available?)
• On the depth of combinatorial optimization problems

Cited in

(2)

• On the depth of combinatorial optimization problems
• On Combinatorial Depth Measures

This page was built for publication: A note on the depth function of combinatorial optimization problems

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