Computational combinatorial optimization. Optimal of probably near-optimal solutions (Q5952232)

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]