Pages that link to "Item:Q3737151"
From MaRDI portal
The following pages link to Strong Formulations for Multi-Item Capacitated Lot Sizing (Q3737151):
Displaying 50 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders (Q336386) (← links)
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- A column generation-based heuristic algorithm for an inventory routing problem with perishable goods (Q375988) (← links)
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics (Q547140) (← links)
- The discrete lot-sizing and scheduling problem (Q582202) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times (Q695342) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times (Q733543) (← links)
- Multilevel capacitated lotsizing complexity and LP-based heuristics (Q811334) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight (Q971702) (← links)
- Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study (Q998715) (← links)
- A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
- Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
- Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
- A simple heuristic for the multi-item single level capacitated lotsizing problem (Q1079109) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem (Q1260745) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing (Q1278343) (← links)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- Modelling piecewise linear concave costs in a tree partitioning problem (Q1326744) (← links)
- Coordination of production and distribution planning (Q1328573) (← links)
- A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
- A linear description of the discrete lot-sizing and scheduling problem (Q1331608) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- Heuristic genetic algorithms for general capacitated lot-sizing problems (Q1609180) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
