Pages that link to "Item:Q3144405"
From MaRDI portal
The following pages link to A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands (Q3144405):
Displaying 28 items.
- On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
- Algorithms for the two-stage production-capacitated lot-sizing problem (Q312482) (← links)
- Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- Two-level lot-sizing with inventory bounds (Q1756341) (← links)
- Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
- Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
- A study of the lot-sizing polytope (Q1881043) (← links)
- Coordination of a two-level supply chain with contracts (Q2044552) (← links)
- Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
- Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions (Q2241314) (← links)
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure (Q2242374) (← links)
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Minimum concave cost flow over a grid network (Q2340279) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid (Q2828332) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Computational study of the multiechelon production planning problem (Q4346863) (← links)
- On the polyhedral structure of two‐level lot‐sizing problems with supplier selection (Q4632950) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713881) (← links)
