The bundle method for hard combinatorial optimization problems

DOI10.1007/3-540-36478-1_9MaRDI QIDQ4414639zbMATH OpenFDO

Authors Gerald Gruber, Franz Rendl

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700078.htm

Mathematics Subject Classification ID

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

Recommendations

• Approximability of hard combinatorial optimization problems: an introduction
• Efficiently solvable special cases of hard combinatorial optimization problems
• Exact Algorithms for Generalized Combinatorial Optimization Problems
• On Approximate Solutions for Combinatorial Optimization Problems
• Bulk-robust combinatorial optimization
• scientific article; zbMATH DE number 780787
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• scientific article; zbMATH DE number 4156211
• An effective branch-and-bound algorithm for the maximum s-bundle problem
• Semidefinite and Lagrangian relaxations for hard combinatorial problems

Cited in

(2)

• Dynamic bundle methods
• New bundle methods for solving Lagrangian relaxation dual problems

This page was built for publication: The bundle method for hard combinatorial optimization problems

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