scientific article; zbMATH DE number 3568353

Cited in

(75)

Fixed-charge transportation on a path: linear programming formulations
Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem
Multiechelon Lot Sizing: New Complexities and Inequalities
Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
Set characterizations and convex extensions for geometric convex-hull proofs
A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
Predictive search for capacitated multi-item lot sizing problems
Worst case analysis of relax and fix heuristics for lot-sizing problems
LS-LIB: a library of tools for solving production planning problems
Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
A class of stochastic programs with decision dependent uncertainty
A computational analysis of lower bounds for big bucket production planning problems
Single item lot sizing problems
Lot-sizing with fixed charges on stocks: the convex hull
Period decompositions for the capacitated lot sizing problem with setup times
A capacitated lot sizing problem with stochastic setup times and overtime
Fixed-charge transportation on a path: optimization, LP formulations and separation
An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
A comparison of heuristics and relaxations for the capacitated plant location problem
Progress with single-item lot-sizing
Efficient reformulations for dynamic lot-sizing problems with product substitution
Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
A heuristic approach for big bucket multi-level production planning problems
Lagrangean relaxation based heuristics for lot sizing with setup times
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
Uncapacitated two-level lot-sizing
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
Robust formulations for economic lot-sizing problem with remanufacturing
Relaxations for two-level multi-item lot-sizing problems
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
A polyhedral study of the static probabilistic lot-sizing problem
Lot sizing with inventory gains
Pricing, relaxing and fixing under lot sizing and scheduling
Dynamic lot-sizing with price changes and price-dependent holding costs
Multi-stage simultaneous lot-sizing and scheduling for flow line production
HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
A linear description of the discrete lot-sizing and scheduling problem
Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
Strong formulations for mixed integer programming: A survey
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
Integrated market selection and production planning: complexity and solution approaches
The production routing problem: a review of formulations and solution algorithms
On formulations of the stochastic uncapacitated lot-sizing problem
Efficient and effective heuristics for the coordinated capacitated lot-size problem
A general quantity discount and supplier selection mixed integer programming model
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
Classification and literature review of integrated lot-sizing and cutting stock problems
Approximation algorithms for supply chain planning and logistics problems with market choice
Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
Capacity expansion with alternative technology choices
The simple plant location problem: Survey and synthesis
On stochastic dynamic programming for solving large-scale planning problems under uncertainty
A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
Heuristics for the multi-item capacitated lot-sizing problem with lost sales
Intermediate integer programming representations using value disjunctions
MIP formulations and heuristics for two-level production-transportation problems
The one-warehouse multi-retailer problem: reformulation, classification, and computational results
Modeling lotsizing and scheduling problems with sequence dependent setups
New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
Influence of consumer purchasing behaviour on the production planning of perishable food
Approximate extended formulations
Reformulation by discretization: application to economic lot sizing
The multi-item capacitated lot-sizing problem with setup times and shortage costs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139966)