Solving incremental quantity discounted transportation problems by vertex ranking

DOI10.1002/nav.3800270308zbMath0448.90039OpenAlexW2010451615MaRDI QIDQ3895227

Patrick G. McKeown

Publication date: 1980

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800270308

zbMATH Keywords

test problemsvertex rankingincremental quantity discounted transportation problemspiecewise-linear objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

Designing distribution systems with transport economies of scale

This page was built for publication: Solving incremental quantity discounted transportation problems by vertex ranking