Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetablingAbdullah, Salwani ; Ahmadi, Samad ; Burke, Edmund K. ; Dror, MosheOR Spectrum, 2007-04, Vol.29 (2), p.351-372 [Periódico revisado por pares]Heidelberg: Springer Nature B.VTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Routing one million customers in a handful of minutesAccorsi, Luca ; Vigo, DanieleComputers & operations research, 2024-04, Vol.164, p.106562, Article 106562 [Periódico revisado por pares]Elsevier LtdTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability ConstraintsAhuja, Ravindra K ; Huang, Wei ; Romeijn, H. Edwin ; Morales, Dolores RomeroINFORMS journal on computing, 2007-12, Vol.19 (1), p.14-26 [Periódico revisado por pares]Linthicum: INFORMSTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Very Large-Scale Neighborhood Search for the Quadratic Assignment ProblemAhuja, Ravindra K ; Jha, Krishna C ; Orlin, James B ; Sharma, DushyantINFORMS journal on computing, 2007-09, Vol.19 (4), p.646-657 [Periódico revisado por pares]Linthicum: INFORMSTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Exact and Heuristic Algorithms for the Weapon-Target Assignment ProblemAhuja, Ravindra K ; Kumar, Arvind ; Jha, Krishna C ; Orlin, James BOperations research, 2007-11, Vol.55 (6), p.1136-1146 [Periódico revisado por pares]Linthicum, MD: INFORMSTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm OptimizationAlinaghian, M. ; Ghazanfari, M. ; Norouzi, N. ; Nouralizadeh, H.Networks and spatial economics, 2017-12, Vol.17 (4), p.1185-1211 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problemAllahyari, Somayeh ; Salari, Majid ; Vigo, DanieleEuropean journal of operational research, 2015-05, Vol.242 (3), p.756-768 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Reoptimisation strategies for dynamic vehicle routing problems with proximity-dependent nodesAndersen, Tiria ; Belward, Shaun ; Sankupellay, Mangalam ; Myers, Trina ; Chen, CarlaTOP, 2024-04, Vol.32 (1), p.1-21 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristicsAndres Figliozzi, MiguelTransportation research. Part E, Logistics and transportation review, 2012-05, Vol.48 (3), p.616-636 [Periódico revisado por pares]Exeter: Elsevier India Pvt LtdTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Comparison of policies in dynamic routing problemsAngelelli, E ; Bianchessi, N ; Mansini, R ; Speranza, M GThe Journal of the Operational Research Society, 2010-04, Vol.61 (4), p.686-695 [Periódico revisado por pares]London: Taylor & FrancisTexto completo disponível |