The following pages link to Approximate extended formulations (Q2583138):
Displaying 36 items.
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Uncapacitated two-level lot-sizing (Q991455) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
- Stochastic lot sizing problem with nervousness considerations (Q1652600) (← links)
- Combined ship routing and inventory management in the salmon farming industry (Q1695779) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
- On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space (Q1785373) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure (Q2242374) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951) (← links)
- Column Generation for Extended Formulations (Q2840735) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
