scientific article; zbMATH DE number 2084781
From MaRDI portal
zbMath1052.90106MaRDI QIDQ4735939
Giovanni Rinaldi, Michael Jünger, Matthias Elf, Carsten Gutwenger
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2241/22410157.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations, Design of survivable IP-over-optical networks, Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints, PEBBL: an object-oriented framework for scalable parallel branch and bound, A branch and cut solver for the maximum stable set problem, Symmetric ILP: Coloring and small integers, An integer programming approach to optimal basic block instruction scheduling for single-issue processors, A tutorial on branch and cut algorithms for the maximum stable set problem, A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation, ABACUS
Uses Software
