The bottleneck problem with minimum quantity commitments

DOI10.1002/NAV.20126MaRDI QIDQ3423267zbMATH OpenOpenAlexFDO

Authors Andrew Lim, Zhou Xu

Publication date 20 February 2007

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

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

zbMATH Keywords

approximate algorithmbottleneck problemminimum quantity commitment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Algorithm Theory - SWAT 2004
• Computing and Combinatorics
• The bidding selection and assignment problem with minimum quantity commitment
• A study of the bottleneck single source transportation problem
• Generalized Bottleneck Problems^∗

Cites work

• Algorithm Theory - SWAT 2004

Cited in

(7)

• Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
• The bidding selection and assignment problem with minimum quantity commitment
• Algorithm Theory - SWAT 2004
• The minimum backlog problem
• The freight allocation problem with lane cost balancing constraint
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• Computing and Combinatorics

This page was built for publication: The bottleneck problem with minimum quantity commitments

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