Mingling: mixed-integer rounding with bounds

DOI10.1007/s10107-009-0265-xzbMath1190.90104OpenAlexW2139797076MaRDI QIDQ964180

Oktay Günlük, Atamtürk, Alper

Publication date: 15 April 2010

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

Full work available at URL: https://doi.org/10.1007/s10107-009-0265-x

zbMATH Keywords

cutting planesmixed-integer roundingsubadditive lifting

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (7)

Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets ⋮ Theoretical challenges towards cutting-plane selection ⋮ Lifting for the integer knapsack cover polyhedron ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem ⋮ \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set ⋮ Fiber cable network design in tree networks ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables

Cites Work

• Unnamed Item
• Cover and pack inequalities for (mixed) integer programming
• Chvátal closures for mixed integer programming problems
• The 0-1 knapsack problem with a single continuous variable
• On the facets of the mixed-integer knapsack polyhedron
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• Valid inequalities based on simple mixed-integer sets
• Integer Programming and Pricing
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Sequence Independent Lifting for Mixed-Integer Programming
• Disjunctive Programming

This page was built for publication: Mingling: mixed-integer rounding with bounds