The mixed vertex packing problem

Mathematical Programming, Series B

Volumn 89, Issue 1, 2000, Pages 35-53

  Atamtürk, Alper ^a,b   Nemhauser, George L ^a   Savelsbergh, Martin W P ^a  

^a Georgia Institute of Technology   (United States)

^b DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 24944462175     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070000154.     Document Type: Article

References (20)

1. Atamtürk, A. (1998): Conflict graphs and flow models for mixed-integer linear optimization problems. PhD thesis, ISyE, Georgia Institute of Technology, Atlanta, USA
2. Atamtürk, A. (1999): Lifted flow pack facets of the single node fixed-charge flow polytope. Research report, IEOR, University of California at Berkeley. Available at http://ieor.berkeley.edu/~atamturk
3. Atamtürk, A., Nemhauser, G.L., Savelsbergh, M.W.P. (2000): Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121, 40-55
4. Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P. (1998): An updated mixed integer programming library: MIPLIB 3.0. Optima 54. Available at URL http://www.caam.rice.edu/ ~bixby/miplib/miplib.html
5. Borndörfer, R., Weismantel, R. (2000): Set packing relaxations of some integer programs. Math. Program., DOI 10.1007/s101070000154. Article in pdf format. Online publication: June 8
6. Cheng, E., Cunningham, W.H. (1997): Wheel inequalities for stable set polytopes. Math. Program. 77, 389-421
7. Erkut, E., Neuman, S. (1991): Comparison of four models for dispersing facilities. INFOR 29, 61-85
8. Grötschel, M., Lovász, L., Schrijver, A. (1993): Geometric Algorithms and Combinatorial Optimization. Springer
9. Hoffman, K., Padberg, M.W. (1993): Solving airline crew-scheduling problems by branch-and-cut. Manage. Sci. 39, 667-682
10. Johnson, E.L. (1989): Modeling and strong linear programs for mixed integer programming. In: Wallace, S.W., ed., Algorithms and Model Formulations in Mathematical Programming, pp. 1-43. Springer, NATO ASI Series, Vol. F51
11. Minoux, M. (1986): Optimal traffic assignment in a ss/tdma frame: A new approach by set covering and column generation. RAIRO 20, 273-286
12. Minoux, M. (1987): A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations. RAIRO 21, 105-136
13. Minoux, M. (1989): Solving combinatorial problems with combined min-max-min-sum objective and applications. Math. Program. 45, 361-372
14. Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S. (1994): MINTO, a mixed integer optimizer. Oper. Res. Lett. 15, 47-58
15. Nemhauser, G.L., Sigismondi, G. (1992): A strong cutting plane/branch-and-bound algorithm for node packing. J. Oper. Res. Soc. 43, 443-457
16. Nemhauser, G.L., Trotter Jr., L.E. (1974): Properties of vertex packing and independence system polyhedra. Math. Program. 6, 48-61
17. Padberg, M.W. (1973): On the facial structure of set packing polyhedra. Math. Program. 5, 199-215
18. Savelsbergh, M.W.P. (1994): Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445-454
19. Trotter Jr., L.E. (1975): A class of facet producing graphs for vertex packing polyhedra. Discrete Math. 12, 373-388
20. Van Roy, T.J., Wolsey, L.A. (1986): Valid inequalities for mixed 0-1 programs. Discrete Appl. Math. 14, 199-213