Standard

An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities. / Okhrin, I.; Richter, K.

в: European Journal of Operational Research, Том 211, № 3, 2011, стр. 507-514.

Результаты исследований: Научные публикации в периодических изданиях › статья

Harvard

Okhrin, I & Richter, K 2011, 'An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities', European Journal of Operational Research, Том. 211, № 3, стр. 507-514.

APA

Okhrin, I., & Richter, K. (2011). An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities. European Journal of Operational Research, 211(3), 507-514.

Vancouver

Okhrin I, Richter K. An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities. European Journal of Operational Research. 2011;211(3):507-514.

Author

Okhrin, I. ; Richter, K. / An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities. в: European Journal of Operational Research. 2011 ; Том 211, № 3. стр. 507-514.

BibTeX

@article{d2cb572a346f4ad485167ed96c508fa0,
title = "An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities",
author = "I. Okhrin and K. Richter",
year = "2011",
language = "English",
volume = "211",
pages = "507--514",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

RIS

TY - JOUR

T1 - An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities

AU - Okhrin, I.

AU - Richter, K.

PY - 2011

Y1 - 2011

M3 - Article

VL - 211

SP - 507

EP - 514

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -

ID: 5385052