An algorithm for large scale 0–1 integer programming with application to airline crew scheduling

This publication has 12 references indexed in Scilit:

• An interior point algorithm to solve computationally difficult set covering problems
  Mathematical Programming, 1991
• A probabilistic heuristic for a computationally difficult set covering problem
  Operations Research Letters, 1989
• Simulated annealing: An introduction
  Statistica Neerlandica, 1989
• A new approach for crew pairing problems by column generation with an application to air transportation
  European Journal of Operational Research, 1988
• Airline Scheduling: An Overview
  Transportation Science, 1985
• A note on some computationally difficult set covering problems
  Mathematical Programming, 1980
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
  Published by Springer Nature ,1980
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
  Published by Springer Nature ,1974
• The Airline Crew Scheduling Problem: A Survey
  Transportation Science, 1969