Scheduling duties by adaptive column generation

[1]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[4]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[5]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[6]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[7]  Celso C. Ribeiro,et al.  A heuristic approach to hard constrained shortest path problems , 1985, Discret. Appl. Math..

[8]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[9]  J. Beasley.  An algorithm for set covering problem , 1987 .

[10]  Anthony Wren,et al.  Computer-Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, July 28-31, 1987 , 1988 .

[11]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[12]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .

[13]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[14]  Martin Desrochers,et al.  CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[15]  Robert E. Bixby,et al.  Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Jean-Marc Rousseau,et al.  Results Obtained with Crew-Opt: A Column Generation Method for Transit Crew Scheduling , 1995 .

[18]  Dag Wedelin,et al.  The design of a 0–1 integer optimizer and its application in the Carmen system , 1995 .

[19]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[20]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[21]  François Soumis,et al.  Decomposition and Column Generation , 1997 .

[22]  Jacques Desrosiers,et al.  Crew pairing for a regional carrier , 1997 .

[23]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[24]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[25]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[26]  Peter Sanders,et al.  High Performance Integer Optimization for Crew Scheduling , 1999, HPCN Europe.

[27]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[28]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .