Binary extended formulations of polyhedral mixed-integer sets

DOI10.1007/S10107-018-1294-0zbMath1391.90425OpenAlexW2804205549WikidataQ129814469 ScholiaQ129814469MaRDI QIDQ1650775

Robert Hildebrand, Sanjeeb Dash, Oktay Günlük

Publication date: 13 July 2018

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

Full work available at URL: https://doi.org/10.1007/s10107-018-1294-0

zbMATH Keywords

branch-and-boundcutting planesmixed-integer programmingextended formulationsbinarization

Mathematics Subject Classification ID

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

Related Items (1)

Lattice Reformulation Cuts

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting planes from extended LP formulations
• On convergence in mixed integer programming
• MIR closures of polyhedral sets
• Cut generation through binarization
• Chvátal closures for mixed integer programming problems
• A characterization of knapsacks with the max-flow--min-cut property
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• On the facets of the mixed-integer knapsack polyhedron
• Fixed-charge transportation problems on trees
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• Split Rank of Triangle and Quadrilateral Inequalities
• Integer Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• On the Value of Binary Expansions for General Mixed-Integer Linear Programs
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Disjunctive Programming
• Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
• Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
• A disjunctive cutting plane procedure for general mixed-integer linear programs

This page was built for publication: Binary extended formulations of polyhedral mixed-integer sets