Lifting for conic mixed-integer programming
From MaRDI portal
Recommendations
Cites work
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Applications of second-order cone programming
- Conic mixed-integer rounding cuts
- Cuts for mixed 0-1 conic programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- On Polyhedral Approximations of the Second-Order Cone
- On the facets of the mixed-integer knapsack polyhedron
- Sequence Independent Lifting for Mixed-Integer Programming
- Sequence independent lifting in mixed integer programming
- Technical Note—A Note on Zero-One Programming
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The submodular knapsack polytope
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(38)- Valid inequalities for mips and group polyhedra from approximate liftings
- Zero-lifting for integer block structured problems
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Combined location-inventory optimization of deteriorating products supply chain based on CQMIP under stochastic environment
- Supermodular covering knapsack polytope
- Mixed integer programming with a class of nonlinear convex constraints
- Sequence independent lifting in mixed integer programming
- Strong formulations for conic quadratic optimization with indicator variables
- 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
- A computational study for common network design in multi-commodity supply chains
- The split closure of a strictly convex body
- On pathological disjunctions and redundant disjunctive conic cuts
- A geometric approach to cut-generating functions
- On minimal valid inequalities for mixed integer conic programs
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- Linear-programming-based lifting and its application to primal cutting-plane algorithms
- Polyhedral approximations in p-order cone programming
- Aircraft rescheduling with cruise speed control
- A geometric perspective on lifting
- scientific article; zbMATH DE number 3856814 (Why is no real title available?)
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- On lifting integer variables in minimal inequalities
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical note: A conic integer optimization approach to the constrained assortment problem under the mixed multinomial logit model
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Disjunctive cuts in mixed-integer conic optimization
- Monoidal strengthening and unique lifting in MIQCPs
- Lifting, tilting and fractional programming revisited
- 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
- Lifts of convex sets in optimization
- Exact approaches for competitive facility location with discrete attractiveness
- Two-term disjunctions on the second-order cone
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)
