Add to ORKGColloque avec actes et comité de lecture. internationale.International audienceWe introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics and illustrate its use through a number of applications
Optimization problems characterized by an embedded network structure in the constraint matrix are fr...
Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
Global constraints are used in constraint programming to help users specify patterns that occur freq...
Abstract We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that...
This report introduces a classification scheme for the global constraints. This classification is ba...
International audienceFinding a constraint network that will be efficiently solved by a constraint s...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
Constraint networks are a simple representation and reasoning framework with diverse applications. I...
Abstract. Most work on constraint satisfaction problems (CSP) starts with a standard problem denitio...
Constraint propagation is widely recognized as a fundamental reasoning component in constraint prog...
Global Constraints: Introduction and Graph-Based Representation.Global Constraints: Introduction and...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by addi...
Global constraints are an essential component in the efficiency of centralized constraint programmin...
Optimization problems characterized by an embedded network structure in the constraint matrix are fr...
Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...
Global constraints are used in constraint programming to help users specify patterns that occur freq...
Abstract We apply to fixed charge network flow (FCNF) problems a general hybrid solution method that...
This report introduces a classification scheme for the global constraints. This classification is ba...
International audienceFinding a constraint network that will be efficiently solved by a constraint s...
Global constraints play a crucial role in solving real-life combinatorial problems thanks to encapsu...
Constraint networks are a simple representation and reasoning framework with diverse applications. I...
Abstract. Most work on constraint satisfaction problems (CSP) starts with a standard problem denitio...
Constraint propagation is widely recognized as a fundamental reasoning component in constraint prog...
Global Constraints: Introduction and Graph-Based Representation.Global Constraints: Introduction and...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by addi...
Global constraints are an essential component in the efficiency of centralized constraint programmin...
Optimization problems characterized by an embedded network structure in the constraint matrix are fr...
Degree constrained subgraph problems and network flow optimization. - Augsburg : Wißner, 1997. - 172...
The constraint satisfaction problem (CSP) comprises n variables with associated finite domains (with...