Graph decomposition into paths under length constraints (2008)
Teypaz, Nicolas, Rapine, Christophe
Given 2 integers a and b, we define an (a,b)-decomposition of a graph G =(V,E) as a partition of E into paths where the length of each path lies between a and b. In this definition paths are...
Graph decomposition into paths under length constraints (2008)
Teypaz, Nicolas, Rapine, Christophe
Given 2 integers a and b, we define an (a,b)-decomposition of a graph G =(V,E) as a partition of E into paths where the length of each path lies between a and b. In this definition paths are...
Solving the Transit Network Design problem with Constraint Programming (2007)
Barra, Alexandre, Carvalho, Luis, Teypaz, Nicolas, Cung, Van Dat, Balassiano, Ronaldo
Transit network design (TND) is a complex combinatorial optimization problem. The goal is to obtain an optimized public transport network, taking into consideration main characteristics of the...
Solving the Transit Network Design problem with Constraint Programming (2007)
Barra, Alexandre, Carvalho, Luis, Teypaz, Nicolas, Cung, Van Dat, Balassiano, Ronaldo
Transit network design (TND) is a complex combinatorial optimization problem. The goal is to obtain an optimized public transport network, taking into consideration main characteristics of the...