Pages that link to "Item:Q2367913"
From MaRDI portal
The following pages link to A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913):
Displayed 37 items.
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
- Spherical cuts for integer programming problems (Q3499437) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs (Q4586174) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling (Q5084615) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q5101407) (← links)
- Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
- Combining and strengthening Gomory cuts (Q5101435) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
- IFORS' Operational Research Hall of Fame (Q5488254) (← links)
- (Q5708497) (← links)
- (Q5708498) (← links)
- Beating the SDP bound for the floor layout problem: a simple combinatorial idea (Q5882276) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5918420) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- Sum-of-squares hierarchies for binary polynomial optimization (Q5925640) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Elementary closures for integer programs. (Q5937498) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- A note on the SDP relaxation of the minimum cut problem (Q6064052) (← links)
- Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts (Q6086008) (← links)
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach (Q6150225) (← links)
- Distributionally risk‐receptive and risk‐averse network interdiction problems with general ambiguity set (Q6179697) (← links)