The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gianpaolo Ghiani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gianpaolo Ghiani, Francesca Guerriero, Roberto Musmanno
    The capacitated plant location problem with multiple facilities in the same site. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:13, pp:1903-1912 [Journal]
  2. Gianpaolo Ghiani, Roberto Musmanno, Giuseppe Paletta, Chefi Triki
    A heuristic for the periodic rural postman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:219-228 [Journal]
  3. Gianpaolo Ghiani, Roberto Musmanno
    Recent algorithmic advances for Arc Routing Problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3361-3362 [Journal]
  4. Gianpaolo Ghiani, Demetrio Laganà, Roberto Musmanno
    A constructive heuristic for the Undirected Rural Postman Problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3450-3457 [Journal]
  5. Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno
    Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:195-198 [Journal]
  6. Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
    The capacitated arc routing problem with intermediate facilities. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:3, pp:134-143 [Journal]
  7. Gianpaolo Ghiani, Gilbert Laporte
    Eulerian location problems. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:291-302 [Journal]
  8. Gianpaolo Ghiani, Gennaro Improta
    An algorithm for the hierarchical Chinese postman problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:1, pp:27-32 [Journal]
  9. Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte
    Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:3, pp:377-387 [Journal]
  10. Pierpaolo Caricato, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero
    Parallel tabu search for a pickup and delivery problem under track contention. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2003, v:29, n:5, pp:631-639 [Journal]
  11. Andrea Attanasio, Gianpaolo Ghiani, Lucio Grandinetti, Francesca Guerriero
    Auction algorithms for decentralized parallel machine scheduling. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2006, v:32, n:9, pp:701-709 [Journal]
  12. Pierpaolo Caricato, Gianpaolo Ghiani, Antonio Grieco, Roberto Musmanno
    Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:178, n:1, pp:85-91 [Journal]
  13. Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, Gilbert Laporte
    Solving the hierarchical Chinese postman problem as a rural postman problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:155, n:1, pp:44-50 [Journal]
  14. Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno
    Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:1, pp:1-11 [Journal]

  15. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs. [Citation Graph (, )][DBLP]


Search in 0.038secs, Finished in 0.039secs
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