Computational combinatorial optimization. Optimal of probably near-optimal solutions

DOI10.1007/3-540-45586-8MaRDI QIDQ5952232zbMATH OpenOpenAlexFDO

Authors

Publication date 9 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-45586-8

zbMATH Keywords

Computational combinatorial optimization

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Combinatorial optimization (90C27)

Review text

The articles of this volume will be reviewed individually. Indexed articles: \textit{Martin, Alexander}, General mixed integer programming: Computational issues for branch-and-cut algorithms, 1-25 [Zbl 1052.90049] \textit{Balas, Egon}, Projection and lifting in combinatorial optimization, 26-56 [Zbl 1052.90061] \textit{Pochet, Yves}, Mathematical programming models and formulations for deterministic production planning problems, 57-111 [Zbl 1052.90028] \textit{Lemaréchal, Claude}, Lagrangian relaxation, 112-156 [Zbl 1052.90065] \textit{Elf, Matthias; Gutwenger, Carsten; Jünger, Michael; Rinaldi, Giovanni}, Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS, 157-222 [Zbl 1052.90106] \textit{Ladányi, Laszlo; Ralphs, Ted K.; Trotter, Leslie E. jun.}, Branch, cut, and price: sequential and parallel, 223-260 [Zbl 1052.90107] \textit{Applegate, David; Bixby, Robert; Chvátal, Vašek; Cook, William}, TSP cuts which do not conform to the template paradigm, 261-303 [Zbl 1052.90060]

Cited in

(14)

• Optimization of dynamic programming methods when solving extremal combinatorial problems
• A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
• A branch-and-cut algorithm for the pallet loading problem
• Combinatorial optimization with interaction costs: complexity and solvable cases
• Exact dual bounds for some nonconvex minimax quadratic optimization problems
• Asynchronous level bundle methods
• Symmetric ILP: Coloring and small integers
• scientific article; zbMATH DE number 3854829 (Why is no real title available?)
• On Approximate Solutions for Combinatorial Optimization Problems
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights
• Incremental bundle methods using upper models
• A branch-and-cut-based heuristic for harvest scheduling with clearcut size constraints in long-term planning: a case study
• An algorithmic framework for convex mixed integer nonlinear programs
• Solving chance-constrained combinatorial problems to optimality

This page was built for publication: Computational combinatorial optimization. Optimal of probably near-optimal solutions

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