A new modeling and solution approach for the set-partitioning problem

Computers and Operations Research

Volumn 35, Issue 3, 2008, Pages 807-813

  Lewis, Mark ^a   Kochenberger, Gary ^b   Alidaee, Bahram ^c  

^a MISSOURI WESTERN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Combinatorial problems; Metaheuristics; Set partitioning

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL EFFICIENCY; CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; METADATA; PROBLEM SOLVING;

BINARY QUADRATIC PROGRAMS; COMBINATORIAL PROBLEMS; METAHEURISTICS; SET-PARTITIONING PROBLEM (SPP);

COMBINATORIAL MATHEMATICS;

EID: 34548424443     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.04.002     Document Type: Article

References (20)

1. Balas E., and Padberg M.W. Set partitioning: a survey. SIAM Review 18 (1976) 710-760
2. Glover F., Kochenberger G., and Alidaee B. Adaptive memory tabu search for binary quadratic programs. Management Science 44 (1998) 336-345
3. Laguna M., and Martí R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11 (1999) 44-52
4. Palubeckis G. Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Annals of Operations Research 131 (2004) 259-282
5. Klabjan D, Johnson EL, Nemhauser GL. Solving large airline crew scheduling problems: random pairing generation and strong branching. Computational Optimization and Applications 2001; 73-91.
6. Kochenberger G, Glover F. In: Hager W, Huang S, Pardalos P, Prokopyev O, editors. A unified framework for modeling and solving combinatorial optimization problems: a tutorial, multiscale optimization methods and applications, Springer, Berlin, 2006, p. 101-24.
7. Kochenberger G., Glover F., Alidaee B., and Rego C. An unconstrained binary programming approach to the vertex coloring problem. Annals of Operations Research 139 (2005) 229-241
8. Kochenberger G.A., Glover F., Alidaee B., and Rego C. A unified modeling and solution framework for combinatorial optimization problems. Operations Research Spectrum 26 (2004) 237-250
9. Lewis M., Alidaee B., and Kochenberger G. Using xQx to model and solve the uncapacitated task allocation problem. Operations Research Letters 33 (2005) 176-182
10. Linderoth J.T., Lee E.K., and Savelsbergh M.W.P. A parallel, LP-based heuristic for large-scale set partitioning problems. INFORMS Journal on Computing 14 (2001) 191-209
11. Wedelin D. An algorithm for large scale 0-1 integer programing with applications to airline crew scheduling. Annals of Operations Research 57 (1995) 283-301
12. Marsten R., and Shepardson F. Exact solution of crew Scheduling Problems using the set partitioning model: recent successful applications. Networks 11 (1981) 165-177
13. Hoffman K., and Padberg M. Solving airline crew scheduling problems by branch and cut. Management Science 39 (1993) 667-682
14. Borndorfer R, Aspects of set packing, partitioning, and covering. PhD thesis, Mathematics Department, Technischen Universtat, Berlin, Germany, 1997.
15. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operations Research 152 (2004) 170-179
16. Elhallaoui I.D., Villeneuve, Soumis F., and Desaulniers G. Dynamic aggregation of set-partitioning constraints in column generation. Operations Research 53 (2005) 632-645
17. Chu P.C., and Beasley J.E. Constraint handling in genetic algorithms: the set partitioning problem. Journal of Heuristics 4 (1998) 323-357
18. Kelly J., and Xu J. A set partitioning based heuristic for the vehicle routing problem. INFORMS Journal on Computing 11 (1999) 161-172
19. Picard J.-C., and Ratliff D.H. A graph-theoretic equivalence for integer programs. Operations Research 2 (1973) 261-269
20. Merz P., and Katayama K. Memetic algorithms for the unconstrained binary quadratic programing problem. BioSystems 78 (2004) 99-118