The bidding selection and assignment problem with minimum quantity commitment

DOI10.1057/PALGRAVE.JORS.2602380MaRDI QIDQ5387408zbMATH OpenOpenAlexFDO

Authors

Publication date 9 May 2008

Published in The 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

Lagrangian relaxationlinear programmingminimum quantity commitmentselection and assignment

Mathematics Subject Classification ID

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

Recommendations

• Algorithm Theory - SWAT 2004
• The bottleneck problem with minimum quantity commitments
• The generalized assignment problem with minimum quantities
• On a dynamic auction mechanism for a bilateral assignment problem
• scientific article; zbMATH DE number 1748495
• Optimal constrained bidding
• Optimal procurement strategies from multiple suppliers with total minimum commitments and order constraints
• Auction/Belief Propagation Algorithms for Constrained Assignment Problem

Cited in

(4)

• The bottleneck problem with minimum quantity commitments
• The freight allocation problem with lane cost balancing constraint
• Computing and Combinatorics
• Algorithm Theory - SWAT 2004

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387408)