Abstract
Solving the well known relaxations for large scale combinatorial optimization problems directly is out of reach. We use Lagrangian relaxations and solve it with the bundle method. The cutting plane model at each iteration which approximates the original problem can be kept moderately small and we can solve it very quickly. We report successful numerical results for approximating maximum cut. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Gruber, G., & Rendl, F. (2003). The bundle method for hard combinatorial optimization problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2570, 78–88. https://doi.org/10.1007/3-540-36478-1_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
