bc-opt: A branch-and-cut code for mixed integer programs
From MaRDI portal
DOI10.1007/S101070050092zbMATH Open0939.90025OpenAlexW2044453435MaRDI QIDQ1961983FDOQ1961983
Authors: Cécile Cordier, Hugues Marchand, Laurence A. Wolsey, Richard Laundy 
Publication date: 3 April 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050092
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cited In (13)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- MPC for discrete-event systems with soft and hard synchronization constraints
- On the equivalence of linear complementarity problems
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Flow pack facets of the single node fixed-charge flow polytope
- Title not available (Why is that?)
- Integrating operations research in constraint programming
- Cutting planes in integer and mixed integer programming
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Integrating operations research in constraint programming
- Classical cuts for mixed-integer programming and branch-and-cut
- Problems of discrete optimization: challenges and main approaches to solve them
Uses Software
This page was built for publication: \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961983)
