| |
|
|
| Registros recuperados : 29 | |
| Registros recuperados : 29 | |
|
|
|
 | Acesso ao texto completo restrito à biblioteca da Embrapa Agricultura Digital. Para informações adicionais entre em contato com cnptia.biblioteca@embrapa.br. |
Registro Completo
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
30/04/1999 |
|
Data da última atualização: |
20/01/2020 |
|
Autoria: |
NARCISO, M. G.; LORENA, L. A. N. |
|
Afiliação: |
MARCELO GONCALVES NARCISO, CNPTIA; LUIZ ANTONIO NOGUEIRA LORENA, LAC/INPE. |
|
Título: |
Using local surrogate information in lagrangean relaxation: an application to symmetric traveling salesman problems. |
|
Ano de publicação: |
1999 |
|
Fonte/Imprenta: |
In: OFICINA DE PLANEJAMENTO E CONTROLE DA PRODUÇÃO EM SISTEMAS DE MANUFATURA, 1., 1999, Campinas. Anais... Campinas: Inpe, 1999. |
|
Páginas: |
p. 52-57. |
|
Idioma: |
Inglês |
|
Notas: |
Projeto tematico 97/13930-1. |
|
Conteúdo: |
The Traveling Salesman Problem (TSP) is one of the most studied problems in Combinatorial Optimization literature. Several articles have been published on the subject and it remains today as an interesting and challenging problem. The most common interpretation of the problem seeks the shortest tour for a salesman on a number of cities or clients. Clients must be visited exactly one time and the salesman must return to their home city. For a comprehensive survey of solution methods, applications and related problems see the book of Lawler et al. [27]. Laporte [25] gives another review, including applications examples on computer wiring, wallpaper cutting, hole punching, job sequencing, dartboard design and crystallography. The problem is well known to be NP-hard [25] justifying the use of heuristics, mainly for large scale problems. Johnson and McGeoch [20] give a recent survey on the use of local search based heuristics. |
|
Palavras-Chave: |
Combinatorial optimization; Lagrangean relaxation; Otimização combinatória; Problema do caixeiro viajante; Relaxação lagrangeana/surrogate; Surrogate relaxation; Traveling salesman problem. |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 01811nam a2200229 a 4500
001 1007282
005 2020-01-20
008 1999 bl uuuu u00u1 u #d
100 1 $aNARCISO, M. G.
245 $aUsing local surrogate information in lagrangean relaxation$ban application to symmetric traveling salesman problems.$h[electronic resource]
260 $aIn: OFICINA DE PLANEJAMENTO E CONTROLE DA PRODUÇÃO EM SISTEMAS DE MANUFATURA, 1., 1999, Campinas. Anais... Campinas: Inpe$c1999
300 $ap. 52-57.
500 $aProjeto tematico 97/13930-1.
520 $aThe Traveling Salesman Problem (TSP) is one of the most studied problems in Combinatorial Optimization literature. Several articles have been published on the subject and it remains today as an interesting and challenging problem. The most common interpretation of the problem seeks the shortest tour for a salesman on a number of cities or clients. Clients must be visited exactly one time and the salesman must return to their home city. For a comprehensive survey of solution methods, applications and related problems see the book of Lawler et al. [27]. Laporte [25] gives another review, including applications examples on computer wiring, wallpaper cutting, hole punching, job sequencing, dartboard design and crystallography. The problem is well known to be NP-hard [25] justifying the use of heuristics, mainly for large scale problems. Johnson and McGeoch [20] give a recent survey on the use of local search based heuristics.
653 $aCombinatorial optimization
653 $aLagrangean relaxation
653 $aOtimização combinatória
653 $aProblema do caixeiro viajante
653 $aRelaxação lagrangeana/surrogate
653 $aSurrogate relaxation
653 $aTraveling salesman problem
700 1 $aLORENA, L. A. N.
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
