Pages that link to "Item:Q623366"
From MaRDI portal
The following pages link to Lifting for conic mixed-integer programming (Q623366):
Displaying 35 items.
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
- Lifts of convex sets in optimization (Q745686) (← links)
- Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Zero-lifting for integer block structured problems (Q1402536) (← links)
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting (Q1424282) (← links)
- Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
- Combined location-inventory optimization of deteriorating products supply chain based on CQMIP under stochastic environment (Q1721493) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
- Sequence independent lifting in mixed integer programming (Q1977865) (← links)
- Strong formulations for conic quadratic optimization with indicator variables (Q2039236) (← links)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- A computational study for common network design in multi-commodity supply chains (Q2257365) (← links)
- The split closure of a strictly convex body (Q2275578) (← links)
- On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs (Q2901026) (← links)
- Linear-programming-based lifting and its application to primal cutting-plane algorithms (Q2901054) (← links)
- Polyhedral approximations in<i>p</i>-order cone programming (Q2926080) (← links)
- Aircraft Rescheduling with Cruise Speed Control (Q2931703) (← links)
- A Geometric Perspective on Lifting (Q3109861) (← links)
- (Q3325453) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Sequence Independent Lifting for Mixed-Integer Programming (Q3637441) (← links)
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
