Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
From MaRDI portal
Recommendations
Cited in
(35)- Four equivalent lot-sizing models
- Single-item dynamic lot-sizing problems: an updated survey
- Two-level lot-sizing with inventory bounds
- Polyhedra for lot-sizing with Wagner-Whitin costs
- A study of the lot-sizing polytope
- Convex hull results for generalizations of the constant capacity single node flow set
- Multi-item uncapacitated lot sizing problem with inventory bounds
- A branch-and-cut algorithm for an assembly routing problem
- The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity
- Minimum concave cost flow over a grid network
- Lot-sizing with fixed charges on stocks: the convex hull
- Lot sizing with inventory gains
- A linear-time algorithm for finding optimal vehicle refueling policies
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
- An exact solution approach for the inventory routing problem with time windows
- Lower bounds in lot-sizing models: A polyhedral study
- On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
- Lot-sizing with stock upper bounds and fixed charges
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- The economic lot-sizing problem with perishable items and consumption order preference
- Finding Optimal Refueling Policies in Transportation Networks
- Lot sizing for material requirements planning systems- an incremental cost approach
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- A polyhedral study of lot-sizing with supplier selection
- Capacitated lot sizing problems with inventory bounds
- Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Learning optimal solutions via an LSTM-optimization framework
- Branch-price-and-cut for the production routing problem with time windows
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- An O(n^2) algorithm for lot sizing with inventory bounds and fixed costs
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
This page was built for publication: Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322130)
