scientific article; zbMATH DE number 2084782
From MaRDI portal
zbMath1052.90107MaRDI QIDQ4735940
Laszlo Ladanyi, Ted K. Ralphs, Leslie E. jun. Trotter
Publication date: 9 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2241/22410223.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
PEBBL: an object-oriented framework for scalable parallel branch and bound, Branching in branch-and-price: A generic scheme, Combined location and routing problems for drug distribution, A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs, Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, An approximate dynamic programming approach for the vehicle routing problem with stochastic demands, Airline crew scheduling: state-of-the-art
Uses Software
