Lifting for conic mixed-integer programming
From MaRDI portal
Publication:623366
DOI10.1007/S10107-009-0282-9zbMATH Open1206.90102OpenAlexW2101719620MaRDI QIDQ623366FDOQ623366
Authors: Vishnu Narayanan, Alper Atamtürk 
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
Recommendations
Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Applications of second-order cone programming
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- On the facets of the mixed-integer knapsack polyhedron
- Sequence independent lifting in mixed integer programming
- On Polyhedral Approximations of the Second-Order Cone
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Sequence Independent Lifting for Mixed-Integer Programming
- Conic mixed-integer rounding cuts
- The submodular knapsack polytope
- Cuts for mixed 0-1 conic programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Technical Note—A Note on Zero-One Programming
Cited In (36)
- On minimal valid inequalities for mixed integer conic programs
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Zero-lifting for integer block structured problems
- Sequence Independent Lifting for Mixed-Integer Programming
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- On lifting integer variables in minimal inequalities
- Valid inequalities for mips and group polyhedra from approximate liftings
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- A geometric perspective on lifting
- Polyhedral approximations in \(p\)-order cone programming
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- Strong formulations for conic quadratic optimization with indicator variables
- A computational study for common network design in multi-commodity supply chains
- Lifts of convex sets in optimization
- Aircraft rescheduling with cruise speed control
- Disjunctive cuts in mixed-integer conic optimization
- Two-term disjunctions on the second-order cone
- Title not available (Why is that?)
- Mixed integer programming with a class of nonlinear convex constraints
- A geometric approach to cut-generating functions
- Linear-programming-based lifting and its application to primal cutting-plane algorithms
- Exact approaches for competitive facility location with discrete attractiveness
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs
- On valid inequalities for mixed integer \(p\)-order cone programming
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Lifting, tilting and fractional programming revisited
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- Supermodular covering knapsack polytope
- The split closure of a strictly convex body
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model
- On pathological disjunctions and redundant disjunctive conic cuts
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Combined location-inventory optimization of deteriorating products supply chain based on CQMIP under stochastic environment
This page was built for publication: Lifting for conic mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623366)
