The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Luis Gouveia: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luis Gouveia
    Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1995, v:22, n:9, pp:959-970 [Journal]
  2. Luis Gouveia, Pedro Martins
    The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:2435-2452 [Journal]
  3. Luis Gouveia, Jose Manuel Pires
    The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:129-145 [Journal]
  4. Walid Ben-Ameur, Luis Gouveia
    Some recent contributions to network optimization. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:1, pp:27-30 [Journal]
  5. Luis Gouveia, Leslie A. Hall
    Multistars and directed flow formulations. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:4, pp:188-201 [Journal]
  6. Luis Gouveia, Pedro Martins
    A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:1, pp:1-16 [Journal]
  7. Luis Gouveia, Thomas L. Magnanti
    Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:3, pp:159-173 [Journal]
  8. Luis Gouveia, Thomas L. Magnanti, Cristina Requejo
    A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:44, n:4, pp:254-265 [Journal]
  9. Walid Ben-Ameur, Luis Gouveia
    Further contributions to network optimization. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:1, pp:1-6 [Journal]
  10. Luis Gouveia, Pierre Pesneau
    On extended formulations for the precedence constrained asymmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:2, pp:77-89 [Journal]
  11. Geir Dahl, Njål Foldnes, Luis Gouveia
    A note on hop-constrained walk polytopes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:345-349 [Journal]
  12. Geir Dahl, Luis Gouveia
    On the directed hop-constrained shortest path problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:1, pp:15-22 [Journal]
  13. Luis Gouveia, Maria João Lopes
    Using generalized capacitated trees for designing the topology of local access networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 1997, v:7, n:4, pp:315-337 [Journal]

  14. Modeling and solving the rooted distance-constrained minimum spanning tree problem. [Citation Graph (, )][DBLP]


  15. The multi-weighted Steiner tree problem: A reformulation by intersection. [Citation Graph (, )][DBLP]


  16. Models for a traveling purchaser problem with additional side-constraints. [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.148secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002