Pages that link to "Item:Q1016115"
From MaRDI portal
The following pages link to Uncapacitated lot sizing with backlogging: the convex hull (Q1016115):
Displaying 28 items.
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
- Two-stage stochastic lot-sizing problem under cost uncertainty (Q383162) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs (Q613341) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- Convex hull results for the warehouse problem (Q1756347) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
- Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales (Q2997889) (← links)
- Uncapacitated lot-sizing: The convex hull of solutions (Q3343777) (← links)
- A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
- Uncapacitated lot-sizing with buying, sales and backlogging (Q4657824) (← links)
- Solving the capacitated lot-sizing problem with backorder consideration (Q4658483) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)
