A dual ascent procedure for the set partitioning problem

Agarwal, 1989, A set-partitionng-based exact algorithm for the vehicle routing problem, Networks, 19, 731, 10.1002/net.3230190702 Atamturk, 1996, A combined lagrangian, linear programming and implication heuristic for large-scale set partitioning problems, Journal of Heuristics, 1, 247, 10.1007/BF00127080 Balas, 1976, Set partitioning: A survey, SIAM Review, 18, 710, 10.1137/1018115 Barahona, 2000, The volume algorithm: Producing primal solutions with a subgradient method, Mathematical Programming Series A, 87, 385, 10.1007/s101070050002 Barahona, 2002, On some difficult linear programs coming from set partitioning, Discrete Applied Mathematics, 118, 3, 10.1016/S0166-218X(01)00252-9 Barnes, 2002, A least-square primal–dual algorithm for solving linear programming problems, Operations Research Letters, 30, 289, 10.1016/S0167-6377(02)00163-3 Barnhart, 1998, Branch and price: Column generation for solving huge integer programs, Operations Research, 46, 316, 10.1287/opre.46.3.316 R. Borndörfer, M. Grötschel, F. Klostermeier, Ch. Küttner, Telebus Berlin: Vehicle scheduling in a dial-a-ride system, Technical Report SC 97-23, ZIB, 1997 R. Borndörfer, Aspect of set packing, partitioning and covering, Ph.D. Dissertation, Technischen Universität, Berlin, 1998 Boschetti, 2003, An exact algorithm for the simplified multiple depot crew scheduling problem, Annals of Operational Research, 127, 177, 10.1023/B:ANOR.0000019089.86834.91 Bramel, 1997, On the effectiveness of the set partitioning formulation for the vehicle routing problem, Operations Research, 45, 295, 10.1287/opre.45.2.295 Chan, 1992, A multiplier adjustment approach for the set partitioning problem, Operations Research, 40, 40, 10.1287/opre.40.1.S40 Christofides, 1981, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical Programming Series, 20, 255, 10.1007/BF01589353 Chu, 1998, Constraint handling in genetic algorithms: The set partitioning problem, Journal of Heuristics, 11, 323, 10.1023/A:1008668508685 CPLEX, Using the CPLEX callable library, ILOG CPLEX Division, 889 Alder Avenue 200, Incline Village, NV 89451, USA, 1997. Information available at: http://www.cplex.com J.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, 2008 M. Esö, Parallel branch and cut for set partitioning, Ph.D. Dissertation, Cornell University, 1999 El-Darzi, 1995, Graph theoretic relaxations of set covering and set partitioning problems, European Journal of Operational Research, 87, 109, 10.1016/0377-2217(94)00115-S Fisher, 1990, Optimal solution of set covering/partitioning problems using dual heuristics, Management Science, 36, 674, 10.1287/mnsc.36.6.674 Hadjiconstantinou, 1995, A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations, Annals of Operational Research, 61, 21, 10.1007/BF02098280 A. Hadjar, O. Marcotte, F. Soumis, A branch-and-cut algorithm for the multiple depot vehicle scheduling problem, Technical Report Les Cahiers du GERAD G-2001-25, 2001 Harche, 1994, Column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Computers & Operations Research, 21, 689, 10.1016/0305-0548(94)90083-3 Hoffman, 1993, Solving airline crew-scheduling problems by branch-and-cut, Management Science, 39, 667, 10.1287/mnsc.39.6.657 Hu, 1999, Computational results with a primal–dual subproblem simplex method, Operations Research Letters, 25, 149, 10.1016/S0167-6377(99)00048-6 IBM Corporation, Optimization subroutine library: Guide and reference, 1995 Joseph, 2000, A concurrent processing framework for the set partitioning problem, Computers & Operations Research, 29, 1375, 10.1016/S0305-0548(01)00037-5 Klabjan, 2004, A practical algorithm for computing the subadditive dual function for set partitioning, Computational Optimization and Application, 29, 347, 10.1023/B:COAP.0000044186.99585.51 Klabjan, 2000, A parallel primal–dual simplex algorithm, Operations Research Letters, 27, 47, 10.1016/S0167-6377(00)00017-1 Kohl, 1999, 2-path cuts for the vehicle routing problem with time windows, Transportation Science, 33, 101, 10.1287/trsc.33.1.101 Linderoth, 2001, A parallel, linear programming based heuristic for large scale set partitioning problems, INFORMS Journal on Computing, 13, 191, 10.1287/ijoc.13.3.191.12630 Marsten, 1981, Exact solution of crew scheduling problems using the set partitioning mode: Recent successful applications, Network, 11, 165, 10.1002/net.3230110208 Mingozzi, 1999, A set partitioning approach to the crew scheduling problem, Operations Research, 47, 873, 10.1287/opre.47.6.873 Ribeiro, 1994, A column generation approach to the multiple-depot vehicle scheduling problem, Operations Research, 42, 41, 10.1287/opre.42.1.41 Wedelin, 1995, An algorithm for large scale 0–1 integer programming with application to airline crew scheduling, Annals of Operations Research, 57, 283, 10.1007/BF02099703