\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs

DOI10.1007/s101070050092zbMath0939.90025OpenAlexW2044453435MaRDI QIDQ1961983

Hugues Marchand, Laurence A. Wolsey, Cécile Cordier, Richard S. 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

zbMATH Keywords

cutsaggregations of constraintsbranch-and-cut mixed integer programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them, MPC for discrete-event systems with soft and hard synchronization constraints, Classical cuts for mixed-integer programming and branch-and-cut, Integrating operations research in constraint programming, Integrating operations research in constraint programming, Cutting planes in integer and mixed integer programming, A branch-and-bound algorithm for concave network flow problems, Flow pack facets of the single node fixed-charge flow polytope, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, On the equivalence of linear complementarity problems

Uses Software

• MIPLIB
• XPRESS
• bc-opt