scientific article; zbMATH DE number 2084782
From MaRDI portal
Publication:4735940
zbMATH Open1052.90107MaRDI QIDQ4735940FDOQ4735940
Authors: László Ladányi, 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 of this publication is not available (Why is that?)
Recommendations
- Parallel branch, cut, and price for large-scale discrete optimization
- Branch-and-price: Column generation for solving huge integer programs
- On distributed solving of the capacitated vehicle routing problem with branch-and-cut algorithms
- scientific article; zbMATH DE number 2084781
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
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)
Cited In (11)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
- Branching in branch-and-price: A generic scheme
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
- Title not available (Why is that?)
- Airline crew scheduling: state-of-the-art
- PEBBL: an object-oriented framework for scalable parallel branch and bound
- Parallel branch, cut, and price for large-scale discrete optimization
- Combined location and routing problems for drug distribution
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735940)
