Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Exact Solution of Several Families of Location-Arc Routing ProblemsFernández, Elena ; Laporte, Gilbert ; Rodríguez-Pereira, JessicaTransportation science, 2019-09, Vol.53 (5), p.1313-1333 [Periódico revisado por pares]Baltimore: INFORMSTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
An Exact Algorithm for Multilevel Uncapacitated Facility LocationOrtiz-Astorquiza, Camilo ; Contreras, Ivan ; Laporte, GilbertTransportation science, 2019-07, Vol.53 (4), p.1085-1106 [Periódico revisado por pares]Baltimore: INFORMSTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
An improved adaptive large neighborhood search algorithm for multiple agile satellites schedulingHe, Lei ; Liu, Xiaolu ; Laporte, Gilbert ; Chen, Yingwu ; Chen, YingguoComputers & operations research, 2018-12, Vol.100, p.12-25 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphsWøhlk, Sanne ; Laporte, GilbertComputers & operations research, 2017-11, Vol.87, p.107-113 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
The multi-vehicle cumulative covering tour problemFlores-Garza, David A. ; Salazar-Aguilar, M. Angélica ; Ngueveu, Sandra Ulrich ; Laporte, GilbertAnnals of operations research, 2017-11, Vol.258 (2), p.761-780 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
A branch-and-cut algorithm for the minimum branch vertices spanning tree problemSilvestri, Selene ; Laporte, Gilbert ; Cerulli, RaffaeleComputers & operations research, 2017-05, Vol.81, p.322-332 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
A hybrid variable neighborhood search for the Orienteering Problem with mandatory visits and exclusionary constraintsPalomo-Martínez, Pamela J. ; Angélica Salazar-Aguilar, M. ; Laporte, Gilbert ; Langevin, AndréComputers & operations research, 2017-02, Vol.78, p.408-419 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
The pickup and delivery problem with time windows and handling operationsVeenstra, Marjolein ; Cherkesly, Marilène ; Desaulniers, Guy ; Laporte, GilbertComputers & operations research, 2017-01, Vol.77, p.127-140 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Exact and heuristic algorithms for the Hamiltonian p-median problemErdoğan, Güneş ; Laporte, Gilbert ; Rodríguez Chía, Antonio M.European journal of operational research, 2016-09, Vol.253 (2), p.280-289 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
A global shooting algorithm for the facility location and capacity acquisition problem on a line with dense demandMurat, Alper ; Laporte, Gilbert ; Verter, VedatComputers & operations research, 2016-07, Vol.71, p.1-15 [Periódico revisado por pares]New York: Elsevier LtdTexto completo disponível |