Coordinated cutting plane generation via multi-objective separation

DOI10.1007/S10107-012-0596-XMaRDI QIDQ2436641zbMATH OpenOpenAlexFDO

Authors E. Amaldi, S. Coniglio, Stefano Gualandi

Publication date 25 February 2014

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-012-0596-x

zbMATH Keywords

coordinated cutting plane generationcutting plane methodsmulti-objective separation

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• General cut-generating procedures for the stable set polytope
• On disjunctive cuts for combinatorial optimization
• Generalized coefficient strengthening cuts for mixed integer programming
• Lifting and separation procedures for the cut polytope
• Zero-coefficient cuts

Cites work

• A fast algorithm for the maximum clique problem
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Primer in Column Generation
• A Weighting Function for Pre-emptive Multicriteria Assignment Problems
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An in-out approach to disjunctive optimization
• Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
• Exact solution of graph coloring problems via constraint programming and column generation
• Gomory cuts revisited
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Model building in mathematical programming.
• Optimizing over the first Chvátal closure
• Optimizing over the split closure
• Safe lower bounds for graph coloring
• SCIP: solving constraint integer programs
• Solving Steiner tree problems in graphs to optimality
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• The Steiner tree problem. II: Properties and classes of facets
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(11)

• Separation of disconnected machining regions on the basis of a CSG model
• Theoretical challenges towards cutting-plane selection
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• On the exact separation of cover inequalities of maximum-depth
• Sparse PSD approximation of the PSD cone
• Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets
• A lexicographic pricer for the fractional bin packing problem
• Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games
• Cutting plane generation through sparse principal component analysis
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
• Approximating polyhedra with sparse inequalities

Describes a project that uses

Uses Software

• SCIP
• SteinLib

This page was built for publication: Coordinated cutting plane generation via multi-objective separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436641)