Similar Search Results

Heuristics for the stochastic Eulerian tour problem

Mohan, Srimathy; Gendreau, Michel; Rousseau, Jean-Marc - In: European journal of operational research : EJOR 203 (2010) 1, pp. 107-117

Persistent link: https://www.econbiz.de/10003928177

The stochastic Eulerian tour problem

Mohan, Srimathy; Gendreau, Michel; Rousseau, Jean-Marc - In: Transportation science : a journal of the Institute for … 42 (2008) 2, pp. 166-174

Persistent link: https://www.econbiz.de/10003735556

On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

Pesant, Gilles; Gendreau, Michel; Potvin, Jean-Yves; … - In: European journal of operational research : EJOR 117 (1999) 2, pp. 253-263

Persistent link: https://www.econbiz.de/10006666559

Solving the 2-rooted mini-max spanning forest problem by branch-and-bound

Mohan, Srimathy; Gendreau, Michel; Rousseau, Jean-Marc - In: European journal of operational research : EJOR 203 (2010) 1, pp. 50-59

Persistent link: https://www.econbiz.de/10008349016

An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows

Pesant, Gilles; Gendreau, Michel; Potvin, Jean-Yves; … - In: Transportation science : the publication of the … 32 (1998) 1, pp. 12-29

Persistent link: https://www.econbiz.de/10006469249

The Stochastic Eulerian Tour Problem

Mohan, Srimathy; Gendreau, Michel; Rousseau, Jean-Marc - In: Transportation science : the publication of the … 42 (2008) 2, pp. 166-174

Persistent link: https://www.econbiz.de/10008045591

Heuristics for the Stochastic Eulerian Tour Problem

Mohan, Srimathy; Gendreau, Michel; Rousseau, Jean-Marc - In: European Journal of Operational Research 203 (2010) 1, pp. 107-117

The Stochastic Eulerian Tour Problem (SETP) seeks the Eulerian tour of minimum expected length on an undirected Eulerian graph, when demand on the arcs that have to be serviced is probabilistic. The SETP is NP-hard and in this paper, we develop three constructive heuristics for this problem. The...

Persistent link: https://www.econbiz.de/10008483269

On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem

Pesant, Gilles; Gendreau, Michel; Potvin, Jean-Yves; … - In: European Journal of Operational Research 117 (1999) 2, pp. 253-263

Persistent link: https://www.econbiz.de/10005271528