Combinatorial optimization: An integer programming perspective

ACM Computing Surveys

Volumn 28, Issue 1, 1996, Pages 55-58

  Chandru, Vijay ^a   Rao, M R ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b INDIAN INSTITUTE OF MANAGEMENT BANGALORE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347479779     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/234313.234341     Document Type: Review

References (10)

1. AHUJA, R. K., MAGNATI, T. L., AND ORLIN, J. B. 1993. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. CONFORTI, M., CORNUEJOLS, G., KAPOOR, A., VUSKOVIC, K., AND RAO, M. R. 1994. Balanced matrices. In Mathematical Programming, State of the Art 1994, J. R. Birge and K. G. Murty, Eds., University of Michigan.
3. COOK, W., LOVASZ, L., AND SEYMOUR, P., ED. 1995. Combinatorial Optimization: Papers from the DIMACS Special Year, Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20. AMS, Providence, RI.
4. FOURER, R., GAY, D. M., AND KERNIGHIAN, B. W. 1993. AMPL: A Modeling Language for Mathematical Programming. Scientific Press.
5. GROTSCHEL, M., LOVASZ, L., AND SCHRIJVER, A. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York.
6. LUSTIG, I. J., MARSTEN, R. E., AND SHANNO, D. F. 1994. Interior point methods for linear programming: Computational state of the art. ORSA J. Comput. 6, 1, 1-14.
7. NEMHAUSER, G. L. AND WOLSEY, L. A. 1988. Integer and Combinatorial Optimization. Wiley, New York.
8. PADBERG, M. W. 1995. Linear Optimization and Extensions. Springer-Verlag, New York.
9. PULLEYBLANK, W. R. 1989. Polyhedral combinatorics. In Handbooks in Operations Research and Management Science (Vol. 1: Optimization). G. L. Nemhauser, A. H. G. Rinooy Kan, and M. J. Todd, Eds. North Holland, Amsterdam, 371-446.
10. SARASWAT, V. AND VAN HENTENRYCK, P., EDS. 1995. Principles and Practice of Constraint Programming. MIT Press, Cambridge, MA.