Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Network Flow Problems in Constraint Programming
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint Programming Contribution to Benders Decomposition: A Case Study
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On global warming: Flow-based soft global constraints
Journal of Heuristics
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Generalizing Global Constraints Based on Network Flows
Recent Advances in Constraints
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Explaining flow-based propagation
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
We propose a generic global constraint that can be applied to model a wide range of network flow problems using constraint programming. In our approach, all key aspects of a network flow can be represented by finite domain variables, making the constraint very expressive. At the same time, we utilize a network simplex algorithm to design a highly efficient, and incremental, domain filtering algorithm. We thus integrate two powerful techniques for discrete optimization: constraint programming and the network simplex algorithm. Our generic constraint can be applied to automatically implement effective and efficient domain filterng algorithms for ad-hoc networks, but also for existing global constraints that rely on a network structure, including several soft global constraints many of which are not yet supported by CP systems. Our experimental results demonstrate the efficiency of our constraint, that can achieve speed-ups of several orders of magnitude with negligible overhead, when compared to a decomposition into primitive constraints.