On the selection and assignment with minimum quantity commitments

DOI10.1007/978-3-540-27798-9_13MaRDI QIDQ4681167zbMATH OpenOpenAlexFDO

Authors F. Wang, Zhou Xu, Andrew Lim, Fan Wang

Publication date 15 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99243

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The bidding selection and assignment problem with minimum quantity commitment
• The bottleneck problem with minimum quantity commitments
• The bottleneck problem with minimum quantity commitments
• Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts
• Analysis of supply contracts with minimum total order quantity commitments and non-stationary demands

Cited in

(3)

• The bottleneck problem with minimum quantity commitments
• The bottleneck problem with minimum quantity commitments
• Optimization models for targeted offers in direct marketing: exact and heuristic algorithms

This page was built for publication: On the selection and assignment with minimum quantity commitments

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