skip to main content
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Resultados 1 2 3 next page
Mostrar Somente
Refinado por: assunto: Algorithms remover assunto: Engineering 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
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

2
A tabu search heuristic for the quay crane scheduling problem
Material Type:
Artigo
Adicionar ao Meu Espaço

A tabu search heuristic for the quay crane scheduling problem

Sammarra, Marcello ; Cordeau, Jean-François ; Laporte, Gilbert ; Monaco, M. Flavia

Journal of scheduling, 2007-10, Vol.10 (4-5), p.327-336 [Periódico revisado por pares]

New York: Springer Nature B.V

Texto completo disponível

3
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

4
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

5
Improved solutions for inventory-routing problems through valid inequalities and input ordering
Material Type:
Artigo
Adicionar ao Meu Espaço

Improved solutions for inventory-routing problems through valid inequalities and input ordering

Coelho, Leandro C. ; Laporte, Gilbert

International journal of production economics, 2014-09, Vol.155, p.391-397 [Periódico revisado por pares]

Amsterdam: Elsevier B.V

Texto completo disponível

6
A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem
Material Type:
Artigo
Adicionar ao Meu Espaço

A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem

Coelho, Leandro C. ; Laporte, Gilbert

International journal of production research, 2013-11, Vol.51 (23-24), p.7156-7169 [Periódico revisado por pares]

London: Taylor & Francis

Texto completo disponível

7
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

8
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

9
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

10
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

Resultados 1 2 3 next page

Personalize Seus Resultados

  1. Editar

Refine Search Results

Expandir Meus Resultados

  1.   

Mostrar Somente

  1. Revistas revisadas por pares (29)

Data de Publicação 

De até
  1. Antes de1998  (3)
  2. 1998Até2006  (4)
  3. 2007Até2010  (3)
  4. 2011Até2014  (13)
  5. Após 2014  (8)
  6. Mais opções open sub menu

Buscando em bases de dados remotas. Favor aguardar.