Valid inequalities based on the interpolation procedure

DOI10.1007/s10107-005-0600-9zbMath1134.90446OpenAlexW1987396831MaRDI QIDQ2490327

Sanjeeb Dash, Oktay Günlük

Publication date: 2 May 2006

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

Full work available at URL: https://doi.org/10.1007/s10107-005-0600-9

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A concise characterization of strong knapsack facets, On the extreme inequalities of infinite group problems, Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra, Mixed-integer cuts from cyclic groups, New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem, A few strong knapsack facets, On a generalization of the master cyclic group polyhedron, On the strength of Gomory mixed-integer cuts as group cuts, Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions, Valid inequalities for mips and group polyhedra from approximate liftings

Uses Software

• QSopt
• CLP
• QSopt-Exact

Cites Work

• Corner polyhedra and their connection with cutting planes
• T-space and cutting planes
• Cyclic group and knapsack facets
• Some polyhedra related to combinatorial problems
• K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Unnamed Item
• Unnamed Item