Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets

DOI10.1007/s10107-015-0959-1zbMath1346.90631OpenAlexW2204018859MaRDI QIDQ312703

Sina Masihabadi, Sujeevraja Sanjeevi, Kiavash Kianfar

Publication date: 16 September 2016

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

Full work available at URL: https://doi.org/10.1007/s10107-015-0959-1

zbMATH Keywords

cutting planefacet\(n\)-step conic MIRmixed integer cone programmingmixed integer knapsack setpolyhedral conic set

Mathematics Subject Classification ID

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

Related Items (3)

A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ On Subadditive Duality for Conic Mixed-integer Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Cover and pack inequalities for (mixed) integer programming
• Conic mixed-integer rounding cuts
• \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
• Mingling: mixed-integer rounding with bounds
• The 0-1 knapsack problem with a single continuous variable
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Sequence independent lifting in mixed integer programming
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
• Valid inequalities based on simple mixed-integer sets
• Sequence Independent Lifting for Mixed-Integer Programming
• n-Step Cycle Inequalities: Facets for Continuous n-Mixing Set and Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem

This page was built for publication: Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets