Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
From MaRDI portal
Publication:2892331
DOI10.1287/ijoc.1050.0162zbMath1241.90181OpenAlexW2157553786MaRDI QIDQ2892331
Matteo Fischetti, Giuseppe Andreello, Alberto Caprara
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1050.0162
Related Items
Integer programming techniques for the nurse rostering problem, Single-commodity robust network design with finite and hose demand sets, Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts, Applying mod-\(k\)-cuts for solving linear ordering problems, Theoretical challenges towards cutting-plane selection, Mixed-integer cuts from cyclic groups, Chance-Constrained Binary Packing Problems, Cutting plane selection with analytic centers and multiregression, Lifting for the integer knapsack cover polyhedron, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, Adaptive cut selection in mixed-integer linear programming, Thinning out Steiner trees: a node-based model for uniform edge costs, Coordinated cutting plane generation via multi-objective separation, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem, A relax-and-cut framework for Gomory mixed-integer cuts, SCIP: solving constraint integer programs, Branch-and-cut approaches for chance-constrained formulations of reliable network design problems, A branch\&cut approach to recharging and refueling infrastructure planning, Virtual private network design over the first Chvátal closure, On the exact separation of cover inequalities of maximum-depth
