Similar Search Results

A classification of formulations for the (time-dependent) traveling salesman problem

Gouveia, Luis; Vo[ss], Stefan - In: European Journal of Operational Research 83 (1995) 1, pp. 69-82

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005277715

Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs

Gouveia, Luis; Lopes, Maria Joao - In: European Journal of Operational Research 121 (2000) 2, pp. 394-411

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005277838

Designing reliable tree networks with two cable technologies

Gouveia, Luis; Janssen, Eric - In: European Journal of Operational Research 105 (1998) 3, pp. 552-568

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005278098

Benders decomposition for the hop-constrained survivable network design problem

BOTTON, Quentin; FORTZ, Bernard; GOUVEIA, Luis; POSS, … - Center for Operations Research and Econometrics (CORE), … - 2011

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by...

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010610480