Pages that link to "Item:Q1424279"
From MaRDI portal
The following pages link to Tight formulations for some simple mixed integer programs and convex objective integer programs (Q1424279):
Displaying 33 items.
- A note on the split rank of intersection cuts (Q647399) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- An integer programming approach for linear programs with probabilistic constraints (Q847852) (← links)
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Mixing MIR inequalities with two divisible coefficients (Q964181) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- The mixing set with divisible capacities: a simple approach (Q1043241) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system (Q1989737) (← links)
- Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens (Q2089774) (← links)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- Approximating two-stage chance-constrained programs with classical probability bounds (Q2329660) (← links)
- A linear programming approach for linear programs with probabilistic constraints (Q2356018) (← links)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
- Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
- A note on the continuous mixing set (Q2517804) (← links)
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management (Q2797463) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
- Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Robust network design: Formulations, valid inequalities, and computations (Q5326784) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
