Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315380zbMATH OpenOpenAlexFDO

Authors Andrew Lim, Zhou Xu

Publication date 7 September 2005

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

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

Mathematics Subject Classification ID

Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The bottleneck problem with minimum quantity commitments
• 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^∗

Cited in

(4)

• The bottleneck problem with minimum quantity commitments
• Computing and Combinatorics
• The bidding selection and assignment problem with minimum quantity commitment
• The minimum backlog problem

This page was built for publication: Algorithm Theory - SWAT 2004

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