A Transportation Problem with Minimum Quantity Commitment

References

• Aardal K., van Hoesel C. Polyhedral techniques in combinatorial optimization: Part I, theory. Statistica Neerlandica (1995a) 50(3Google Scholar
• Aardal K., van Hoesel C. Polyhedral techniques in combinatorial optimization: Part II, applications and computations. Statistica Neerlandica (1995b) 50(3Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Al-Sultan K., Al-Fawzan M. A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. (1999) 86:91–103Crossref, Google Scholar
• Balinski M. On finding integer solutions to linear programs. Proc. IBM Sci. Computing Symp. on Combin. Problem (1966) (IBM)225–248Google Scholar
• Bassok Y., Anupindi R. Analysis of supply contracts with total minimum commitment. IIE Trans. (1997) 29(5Google Scholar
• Bonser J., Wu S. Procurement planning to maintain both short-term adaptiveness and long-term perspective. Management Sci. (2001) 47(6):769–786Link, Google Scholar
• Bozkaya B., Zhang J., Erkut E., Drezner Z., Hamacher H. A genetic algorithm for the p median problem. Facility Location: Applications and Theory (2002) (Springer, Berlin, Germany) Google Scholar
• Brown G., Dell R., Newman A. Optimizing military capital planning. Interfaces (2004) 34(6):415–425Link, Google Scholar
• Chen F., Krass D. Analysis of supply contracts with minimum total order quantity commitments and nonstationary demands. Eur. J. Oper. Res. (1999) 131:309–323Crossref, Google Scholar
• Cornuéjols G., Nemhauser G. L., Wolsey L. A., Mirchandani P., Francis R. The uncapacitated facility location problem. Discrete Location Theory (1990) (Wiley, New York) 119–171Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1983) (Freeman, New York) Google Scholar
• Guha S., Meyerson A., Munagala K. Hierarchical placement and network design problems. Proc. 41st Annual IEEE Sympos. Foundations Comput. Sci. (2000) Washington, D.C.(IEEE Computer Society)603–612Google Scholar
• Hochbaum D. S. Heuristics for the fixed cost median problem. Math. Programming (1982) 22:148–162Crossref, Google Scholar
• Jain K., Mahdian M., Saberi A. A new greedy approach for facility location problems. Proc. 34th ACM Sympos. Theory Comput. (STOC) (2002) New York(ACM Press)Google Scholar
• Karger D. R., Minkoff M. Building Steiner trees with incomplete global knowledge. Proc. 41st Annual IEEE Sympos. Foundations Comput. Sci. (2000) Washington, D.C.(IEEE Computer Society)613–623Crossref, Google Scholar
• Lim A., Wang F., Xu Z. A transportation problem with minimum quantity commitments. (2003) . Working paper, Hong Kong University of Science and Technology, Hong KongGoogle Scholar
• Mahdian M., Ye Y., Zhang J. Improved approximation algorithms for metric facility location problems. Proc. 5th Int. Workshop Approximation Algorithms Combin. Optim. (2002) London, U.K.(Springer-Verlag)229–242Google Scholar
• Radcliffe N. J., Whitley L. D. Genetic set recombination. Proc. 2nd Workshop Foundations Genetic Algorithms (1993) (Morgan Kaufmann Publishers, San Mateo, CA) 203–219Google Scholar
• Rolland E., Schilling D. A., Current J. R. An efficient tabu search procedure for the p-median problem. Eur. J. Oper. Res. (1996) 21:329–342Google Scholar
• Shmoys D. B., Tardos E., Aardal K. Approximation algorithms for facility location problems (extended abstract). Proc. 29th Annual ACM Sympos. Theory Comput. (1997) (ACM Press, New York) 265–274Google Scholar
• Wolsey L. A.Integer Programming (1998) (John Wiley & Sons, Inc., New York) Google Scholar