Properties of some ILP formulations of a class of partitioning problems

Discrete Applied Mathematics

Volumn 87, Issue 1-3, 1998, Pages 11-23

  Caprara, Alberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042722371     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00046-8     Document Type: Article

References (15)

1. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, P.H. Vance, Branch-and-price: column generation for solving huge integer programs, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming: State of the Art 1994, 1994, pp. 186-207.
2. A. Caprara, P. Toth, Lower bounds and algorithms for the 2-dimensional vector packing problem, Technical Report OR-97-3, DEIS, University of Bologna, 1997.
3. G. Cornuejols, G.L. Nemhauser, L.A. Wolsey, The uncapacitated facility location problem, in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley, New York, 1991.
4. M. Dell'Amico, S. Martello, Optimal scheduling of tasks on identical parallel processors, ORSA J. Comput. 7 (1995) 191-200.
5. M.R. Garey, R.L. Graham, D.S. Johnson, A.C. Yao, Resource constrained scheduling as generalized bin packing, J. Combin. Theory (A) 21 (1976) 257-298.
6. A.M. Geoffrion, Lagrangean relaxation for integer programming, Mathematical Programming Study 2 (1974) 82-114.
7. M.X. Goemans, Worst-case comparison of valid inequalities for the TSP, Math. Programming 69 (1995) 335-349.
8. M.X. Goemans, L.A. Hall, The strongest facets of the acyclic subgraph polytope are unknown, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.) Proceedings 5th IPCO Conf., Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 415-429.
9. M. Labbé, G. Laporte, S. Martello, An exact algorithm for the dual bin packing problem, Oper. Res. Lett. 17 (1995) 9-18.
10. M. Labbé, G. Laporte, S. Martello, Upper bounds and algorithms for the maximum cardinality bin packing problem, Les Cahiers du GERAD G-97-05, École des Hautes Études Commerciales, Montréal, 1997.
11. J. Lee, J. Leung, A comparison of two edge coloring formulations, Oper. Res. Lett. 13 (1993) 215-223.
12. S. Martello, P. Toth, Lower bounds and reduction procedures for the bin packing problem, Discrete Appl. Math. 28 (1990) 59-70.
13. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990.
14. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
15. P.H. Vance, C. Barnhart, E.L. Johnson, G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Comput. Optim. Appl. 3 (1994) 111-130.