Skip to main content
SpringerLink
Log in

Network Flow Problems in Constraint Programming

  • Conference paper
  • First Online:
Book cover Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

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

Abstract

We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.

This work was partially supported by the European Commission, Growth Programme, Research Project LISCOS - Large Scale Integrated Supply Chain Optimisation Software, Contract No. G1RD-CT-1999-00034

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57–73, 1993.

    Article  Google Scholar 

  2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: theory, algorithms and applications. Prentice Hall, 1993.

    Google Scholar 

  3. R. K. Ahuja, J. B. Orlin, G. M. Sechi, and P. Zuddas. Algorithms for the simple equal flow problem. Management Science, 45(10):1440–1455, 1999.

    Article  Google Scholar 

  4. N. Beldiceanu. Global constraints as graph properties on a structured network of elementary constraints of the same type. In Principles and Practice of Constraint Programming, CP’2000, Singapore, pages 52–66. Springer, LNCS 1894, 2000.

    Google Scholar 

  5. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97–123, 1994.

    Article  Google Scholar 

  6. N. Beldiceanu, H. Simonis, Ph. Kay, and P. Chan. The CHIP system, 1997. http://www.cosytec.fr/whitepapers/PDF/english/chip3_OnlinePDF.pdf.

  7. A. Bockmayr and T. Kasper. Branch-and-infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Computing, 10(3):287–300, 1998.

    Article  MathSciNet  Google Scholar 

  8. H. A. Eiselt and C.-L. Sandblom. Integer programming and network models. Springer, 2000.

    Google Scholar 

  9. F. Focacci, A. Lodi, and M. Milano. Cutting planes in constraint programming: An hybrid approach. In Principles and Practice of Constraint Programming, CP’2000, Singapore, pages 187–201. Springer, LNCS 1894, 2000.

    MATH  Google Scholar 

  10. A. J. Hoffman. Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. Proceedings of Symposia on Applied Mathematics, 10:113–127, 1960.

    Article  MathSciNet  Google Scholar 

  11. H. J. Kim and J. N. Hooker. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. GSIA, Carnegie Mellon University, January 2001.

    Google Scholar 

  12. K. Mehlhorn and S. Thiel. Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In Principles and Practice of Constraint Programming, CP’2000, Singapore, pages 306–319. Springer, LNCS 1894, 2000.

    MATH  Google Scholar 

  13. M. Milano, G. Ottosson, P. Refalo, and E. S. Thorsteinsson. Global constraints: When constraint programming meets operation research. INFORMS Journal on Computing, Special Issue on the Merging of Mathematical Programming and Constraint Programming, March 2001. Submitted.

    Google Scholar 

  14. G. Ottosson, E. S. Thorsteinsson, and J. N. Hooker. Mixed global constraints and inference in hybrid CLP-IP solvers. Annals of Mathematics and Artificial Intelligence, Special Issue on Large Scale Combinatorial Optimisation and Constraints, March 2001. Accepted for publication.

    Google Scholar 

  15. P. Refalo. Linear formulation of constraint programming models and hybrid solvers. In Principles and Practice of Constraint Programming, CP’2000, Singapore, pages 369–383. Springer, LNCS 1894, 2000.

    MATH  Google Scholar 

  16. J.-C. Régin and M. Rueher. A global constraint combining a sum constraint and difference constraint. In Principles and Practice of Constraint Programming, CP’2000, Singapore, pages 384–395. Springer, LNCS 1894, 2000.

    MATH  Google Scholar 

  17. H. Simonis, A. Aggoun, N. Beldiceanu, and E. Bourreau. Complex constraint abstraction: Global constraint visualisation. In Analysis and Visualization Tools for Constraint Programming, pages 299–317. Springer, LNCS 1870, 2000.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vandœuvre-lès-Nancy, France

    Alexander Bockmayr & Nicolai Pisaruk

  2. COSYTEC S.A., Parc Club Orsay Université, 4, rue Jean Rostand, F-91893, Orsay, France

    Abderrahmane Aggoun

Authors
  1. Alexander Bockmayr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolai Pisaruk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abderrahmane Aggoun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bockmayr, A., Pisaruk, N., Aggoun, A. (2001). Network Flow Problems in Constraint Programming. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

  • Online ISBN: 978-3-540-45578-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation