The bidding selection and assignment problem with minimum quantity commitment

DOI10.1057/palgrave.jors.2602380zbMath1156.90402OpenAlexW2009481876MaRDI QIDQ5387408

No author found.

Publication date: 9 May 2008

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602380

zbMATH Keywords

linear programmingLagrangian relaxationminimum quantity commitmentselection and assignment

Mathematics Subject Classification ID

Linear programming (90C05) Discrete location and assignment (90B80)

Related Items (1)

The freight allocation problem with lane cost balancing constraint

This page was built for publication: The bidding selection and assignment problem with minimum quantity commitment