Algorithm Theory - SWAT 2004

DOI10.1007/B98413zbMATH Open1095.90603OpenAlexW2615963353MaRDI QIDQ5315380FDOQ5315380

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

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^∗

Mathematics Subject Classification ID

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

Cited In (4)

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

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)