Segui
Luis Gouveia
Luis Gouveia
Professor Catedrático da faculdade de Ciências da Universidade de Lisboa
Email verificata su fc.ul.pt
Titolo
Citata da
Citata da
Anno
A classification of formulations for the (time-dependent) traveling salesman problem
L Gouveia, S Voß
European Journal of Operational Research 83 (1), 69-82, 1995
1891995
Multicommodity flow models for spanning trees with hop constraints
L Gouveia
European Journal of Operational Research 95 (1), 178-190, 1996
1651996
Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
L Gouveia, TL Magnanti
Networks: An International Journal 41 (3), 159-173, 2003
1292003
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
L Gouveia, L Simonetti, E Uchoa
Mathematical Programming 128 (1), 123-148, 2011
1242011
Benders decomposition for the hop-constrained survivable network design problem
Q Botton, B Fortz, L Gouveia, M Poss
INFORMS journal on computing 25 (1), 13-26, 2013
1232013
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
L Gouveia
Computers & Operations Research 22 (9), 959-970, 1995
1191995
A result on projection for the vehicle routing problem
L Gouveia
European Journal of Operational Research 85 (3), 610-624, 1995
1171995
Solving the variable size bin packing problem with discretized formulations
I Correia, L Gouveia, F Saldanha-da-Gama
Computers & Operations Research 35 (6), 2103-2113, 2008
1162008
A 2n constraint formulation for the capacitated minimal spanning tree problem
L Gouveia
Operations research 43 (1), 130-141, 1995
1141995
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
L Gouveia
INFORMS Journal on Computing 10 (2), 180-188, 1998
1071998
On formulations and methods for the hop-constrained minimum spanning tree problem
G Dahl, L Gouveia, C Requejo
Handbook of optimization in telecommunications, 493-515, 2006
922006
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
L Gouveia, C Requejo
European Journal of Operational Research 132 (3), 539-552, 2001
912001
MPLS over WDM network design with packet level QoS constraints based on ILP models
L Gouveia, P Patrício, AF de Sousa, R Valadas
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE …, 2003
872003
The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraints
L Gouveia, JM Pires
European Journal of Operational Research 112 (1), 134-146, 1999
861999
On the directed hop-constrained shortest path problem
G Dahl, L Gouveia
Operations Research Letters 32 (1), 15-22, 2004
682004
Modeling and solving the rooted distance-constrained minimum spanning tree problem
L Gouveia, A Paias, D Sharma
Computers & Operations Research 35 (2), 600-613, 2008
612008
Lower bounds for the mixed capacitated arc routing problem
L Gouveia, MC Mourão, LS Pinto
Computers & Operations Research 37 (4), 692-699, 2010
602010
Natural and extended formulations for the time-dependent traveling salesman problem
MT Godinho, L Gouveia, P Pesneau
Discrete Applied Mathematics 164, 138-153, 2014
562014
Minimal spanning trees with a constraint on the number of leaves
LM Fernandes, L Gouveia
European Journal of Operational Research 104 (1), 250-261, 1998
561998
On extended formulations for the precedence constrained asymmetric traveling salesman problem
L Gouveia, P Pesneau
Networks: An International Journal 48 (2), 77-89, 2006
532006
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20