skip to main content
Idioma:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Busca Simples
Resultados 1 2 3 next page
Refinado por: assunto: Algorithms remover assunto: Computer Science, Interdisciplinary Applications remover assunto: Studies remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
Material Type:
Artigo 		Adicionar ao Meu Espaço

A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows

Belhaiza, Slim ; Hansen, Pierre ; Laporte, Gilbert

Computers & operations research, 2014-12, Vol.52 (Part B), p.269-281 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
2
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem

Berbeglia, Gerardo ; Cordeau, Jean-Francois ; Laporte, Gilbert

INFORMS journal on computing, 2012-06, Vol.24 (3), p.343-355 [Periódico revisado por pares]

Linthicum: INFORMS

Texto completo disponível

Citações Citado por
3
Optimal joint replenishment, delivery and inventory management policies for perishable products
Optimal joint replenishment, delivery and inventory management policies for perishable products
Material Type:
Artigo 		Adicionar ao Meu Espaço

Optimal joint replenishment, delivery and inventory management policies for perishable products

Coelho, Leandro C. ; Laporte, Gilbert

Computers & operations research, 2014-07, Vol.47, p.42-52 [Periódico revisado por pares]

Kidlington: Elsevier Ltd

Texto completo disponível

Citações Citado por
4
Heuristics for the multi-vehicle covering tour problem
Heuristics for the multi-vehicle covering tour problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

Heuristics for the multi-vehicle covering tour problem

Hachicha, Mondher ; John Hodgson, M ; Laporte, Gilbert ; Semet, Frédéric

Computers & operations research, 2000, Vol.27 (1), p.29-42 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
5
Exact formulations and algorithm for the train timetabling problem with dynamic demand
Exact formulations and algorithm for the train timetabling problem with dynamic demand
Material Type:
Artigo 		Adicionar ao Meu Espaço

Exact formulations and algorithm for the train timetabling problem with dynamic demand

Barrena, Eva ; Canca, David ; Coelho, Leandro C. ; Laporte, Gilbert

Computers & operations research, 2014-04, Vol.44, p.66-74 [Periódico revisado por pares]

Kidlington: Elsevier Ltd

Texto completo disponível

Citações Citado por
6
The pickup and delivery problem with time windows and handling operations
The pickup and delivery problem with time windows and handling operations
Material Type:
Artigo 		Adicionar ao Meu Espaço

The pickup and delivery problem with time windows and handling operations

Veenstra, Marjolein ; Cherkesly, Marilène ; Desaulniers, Guy ; Laporte, Gilbert

Computers & operations research, 2017-01, Vol.77, p.127-140 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
7
Heuristics for finding k-clubs in an undirected graph
Heuristics for finding k-clubs in an undirected graph
Material Type:
Artigo 		Adicionar ao Meu Espaço

Heuristics for finding k-clubs in an undirected graph

Bourjolly, Jean-Marie ; Laporte, Gilbert ; Pesant, Gilles

Computers & operations research, 2000-05, Vol.27 (6), p.559-569 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
8
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs

Wøhlk, Sanne ; Laporte, Gilbert

Computers & operations research, 2017-11, Vol.87, p.107-113 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
9
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem

Mattos Ribeiro, Glaydston ; Laporte, Gilbert

Computers & operations research, 2012-03, Vol.39 (3), p.728-735 [Periódico revisado por pares]

Kidlington: Elsevier Ltd

Texto completo disponível

Citações Citado por
10
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem

Silvestri, Selene ; Laporte, Gilbert ; Cerulli, Raffaele

Computers & operations research, 2017-05, Vol.81, p.322-332 [Periódico revisado por pares]

New York: Elsevier Ltd

Texto completo disponível

Citações Citado por
Resultados 1 2 3 next page

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.