A Lagrange relaxation approach for very-large-scale capacitated lot-sizing

Authors:
Moustapha Diaby;Harish C. Bahl;Mark H. Karwan;Stanley Zionts
Affiliations:
-;-;-;-
Venue:
Management Science
Year:
1992

Citing 0
Cited 8

An integer local search method with application to capacitated production planning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs

Computers and Operations Research
A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

Computers and Operations Research
The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

Computers and Operations Research
Integer optimization by local search: a domain-independent approach

Integer optimization by local search: a domain-independent approach
Model and solution for the multilevel production-inventory system before ironmaking in shanghai baoshan iron and steel complex

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Large-Scale Joint Price-Inventory Decision Problems, Under Resource Limitation and a Discrete Price Set

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract