Lifting for conic mixed-integer programming

DOI10.1007/S10107-009-0282-9zbMath1206.90102OpenAlexW2101719620MaRDI QIDQ623366

Vishnu Narayanan, Atamtürk, Alper

Publication date: 14 February 2011

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-0282-9

zbMATH Keywords

integer programmingvalid inequalitiesconic optimization

Mathematics Subject Classification ID

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

Related Items (22)

Exact approaches for competitive facility location with discrete attractiveness ⋮ A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization ⋮ Polyhedral approximations inp-order cone programming ⋮ Aircraft Rescheduling with Cruise Speed Control ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Two-term disjunctions on the second-order cone ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ Combined location-inventory optimization of deteriorating products supply chain based on CQMIP under stochastic environment ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ Supermodular covering knapsack polytope ⋮ Mixed integer programming with a class of nonlinear convex constraints ⋮ On valid inequalities for mixed integer \(p\)-order cone programming ⋮ A computational study for common network design in multi-commodity supply chains ⋮ A conic quadratic formulation for a class of convex congestion functions in network flow problems ⋮ The split closure of a strictly convex body ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On pathological disjunctions and redundant disjunctive conic cuts ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model ⋮ A geometric approach to cut-generating functions

Cites Work

• A strong conic quadratic reformulation for machine-job assignment with controllable processing times
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Conic mixed-integer rounding cuts
• The submodular knapsack polytope
• Applications of second-order cone programming
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
• On the facets of the mixed-integer knapsack polyhedron
• Sequence independent lifting in mixed integer programming
• Cuts for mixed 0-1 conic programming
• Lectures on Modern Convex Optimization
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
• Sequence Independent Lifting for Mixed-Integer Programming
• Technical Note—A Note on Zero-One Programming
• Technical Note—Facets and Strong Valid Inequalities for Integer Programs
• Valid Inequalities and Superadditivity for 0–1 Integer Programs
• On Polyhedral Approximations of the Second-Order Cone
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

This page was built for publication: Lifting for conic mixed-integer programming