1 |
S. Lavoie, M. Minoux, and E. Odier, 'A new approach for crew pairing problems by column generation with an application to air transportation,' European Journal of Operations Research, 35:45-58, 1988
DOI
ScienceOn
|
2 |
E. Aarts, J. Korst, and P. Laarhoven, 'Simulated annealing,' Local Search in Combinatorial Optimization, John Wiley & Sons, 91-120, 1997
|
3 |
F. Glover, and M. Laguna, Tabu search, Kluwer Academic Publishers, 1997
|
4 |
L. Bodin, B. Golden, A. Assad, and M. Ball, 'Routing and scheduling of vehicles and crews: the state of the art,' Computers and Operations Research, 10:63-211, 1983
DOI
ScienceOn
|
5 |
A. Caprara, M. Fischetti, P.L. Guida, P. Toth, and D. Vigo, 'Solution of large-scale railway crew planning problems: The Italian experience,' Technical Report OR-97-9, DEIS University of Bologna, 1997
|
6 |
ILOG CPLEX, Reference and User Manual, Version 7.0, 2000
|
7 |
L.A. Wolsey, Integer programming, Wiley, 1998
|
8 |
C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, 'Branch and price: Column generation for huge integer programs,' Operations Research, 46:316-329, 1998
DOI
ScienceOn
|
9 |
황준하, 박춘희, 이용환, 류광렬, '정수계획법과 휴리스틱 탐색기법의 결합에 의한 승무일정계획의 최적화' 정보과학회논문지, 8(2):195-205, 2002
과학기술학회마을
|
10 |
R. Church, and C. ReVelle, 'The maximal covering location problem,' Papers of the Regional Science Association, 32:101-118, 1974
DOI
|
11 |
J,E. Beasly, and P.C. Chu, 'A genetic algorithm for the set covering problem,' European Journal of Operational Research, 94:392-404, 1996
DOI
ScienceOn
|
12 |
S. Ceria, P. Nobill, and A. Sassano, 'A Lagrangian-based heuristic for large-scale set covering problems,' Mathematical Programming, 81:215-228, 1998
DOI
|