Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1994: Algorithms — ESA '94 pp 319–330Cite as

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 855))

Abstract

We present an approximation algorithm for solving 0–1 integer programming problems where A is 0–1 and where b is integer. The method is based on a simple dual coordinate ascent method for solving the LP relaxation, reformulated as an unconstrained nonlinear problem, and an approximation scheme working together with this method. We report results on solving set covering problems in the CARMEN airline crew scheduling system, used by SAS and Lufthansa.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas E. and Ho A. (1979). Set Covering Algorithms using Cutting Planes, Heuristics and Subgradient optimization: a Computational Study. Man. Sc. Res. Rep. 438, Carnegie-Mellon Univ.

    Google Scholar 

  2. Bertele U. and Brioschi F. (1972). Nonserial Dynamic Programming. Academic Press.

    Google Scholar 

  3. Chvatal, V. (1979). A greedy-heuristic for the Set-Covering problem. Math. Oper. Res. 4, 233–235.

    MATH  MathSciNet  Google Scholar 

  4. CPLEX Reference Manual (1992). CPLEX Optimization Inc.

    Google Scholar 

  5. Derosiers J., Dumas. Y, Solomon M.M. and Soumis F. (1993) Time Constrained Routing and Scheduling. To be published in Handbooks in Operations Research and Management Science, volume on networks. North-Holland.

    Google Scholar 

  6. Garey M.R and Johnson D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co.

    Google Scholar 

  7. Hu T.C. (1969) Integer Programming and Network Flows. Addison-Wesley.

    Google Scholar 

  8. Lavoie, S., Minoux, M. and Odier, E. (1988) A new approach for crew pairing problems with an application to air transportation. European Journal of Operations Research 35, 45–58.

    Article  Google Scholar 

  9. Nemhauser G.L. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. Wiley.

    Google Scholar 

  10. Syslo M., Deo N. and Kowalik J.S. (1983). Discrete Optimization Algorithms. Prentice-Hall.

    Google Scholar 

  11. Wedelin D. (1989). Probabilistic Networks And Combinatorial Optimization. Technical report 49, Dept. of Computer Science, Chalmers Univ. of Tech.

    Google Scholar 

  12. Wedelin D. (1993). Probabilistic Inference, Combinatorial Optimization and the Discovery of Causal Structure from Data. PhD Thesis. Dept. of Computing Science, Chalmers Univ. of Tech.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, Chalmers Univ. of Tech., S-412 96, Gothenburg, Sweden

    Dag Wedelin

Authors
  1. Dag Wedelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wedelin, D. (1994). An algorithm for 0–1 programming with application to airline crew scheduling. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049419

Download citation

  • DOI: https://doi.org/10.1007/BFb0049419

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation