Network Flow Problems in Constraint Programming
- 19 November 2001
- book chapter
- Published by Springer Nature
- p. 196-210
- https://doi.org/10.1007/3-540-45578-7_14
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same TypePublished by Springer Nature ,2000
- Linear Formulation of Constraint Programming Models and Hybrid SolversPublished by Springer Nature ,2000
- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent ConstraintPublished by Springer Nature ,2000
- Cutting Planes in Constraint Programming: An Hybrid ApproachPublished by Springer Nature ,2000
- Integer Programming and Network ModelsPublished by Springer Nature ,2000
- Algorithms for the Simple Equal Flow ProblemManagement Science, 1999
- Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint ProgrammingINFORMS Journal on Computing, 1998
- Introducing global constraints in CHIPMathematical and Computer Modelling, 1994
- Extending chip in order to solve complex scheduling and placement problemsMathematical and Computer Modelling, 1993
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysisProceedings of Symposia in Applied Mathematics, 1960