An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem.

Research output: Contribution to journal › Article › Academic › peer-review

19 Citations (Scopus)

Original language	Undefined/Unknown
Pages (from-to)	3583-3599
Number of pages	17
Journal	Computers and Operations Research
Volume	33
Issue number	12
DOIs	https://doi.org/10.1016/j.cor.2005.02.046
Publication status	Published - 2006

Access to Document

@article{2f1f8723f5ee44f68396aa6507753ac4,

title = "An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem.",

author = "{van den Heuvel}, Wilco and Albert Wagelmans",

year = "2006",

doi = "10.1016/j.cor.2005.02.046",

language = "Undefined/Unknown",

volume = "33",

pages = "3583--3599",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "12",

}

TY - JOUR

T1 - An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem.

AU - van den Heuvel, Wilco

AU - Wagelmans, Albert

PY - 2006

Y1 - 2006

U2 - 10.1016/j.cor.2005.02.046

DO - 10.1016/j.cor.2005.02.046

M3 - Article

SN - 0305-0548

VL - 33

SP - 3583

EP - 3599

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 12

ER -