Zobrazeno 1 - 10 of 19 pro vyhledávání: '"Verhoeven, M.G.A."'
2
Sequential and parallel local search algorithms for job shop scheduling
Autor: Eikelder, ten, H.M.M., Aarts, B.J.M., Aarts, E.H.L., Verhoeven, M.G.A.
Publikováno v: Abstracts of 2nd International Conference on Metaheuristics (July 21-24, 1997), 75-80
STARTPAGE=75;ENDPAGE=80;TITLE=Abstracts of 2nd International Conference on Metaheuristics (July 21-24, 1997)
Meta-heuristics : Advances and Trends in Local Search Paradigms for Optimization (Proceedings MIC-97, Sophia-Antipolis, France, July 21-24, 1997), 359-371
STARTPAGE=359;ENDPAGE=371;TITLE=Meta-heuristics : Advances and Trends in Local Search Paradigms for Optimization (Proceedings MIC-97, Sophia-Antipolis, France, July 21-24, 1997)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2289ac8d5721a20c95650a906420abac
https://research.tue.nl/nl/publications/d8d444f0-e961-4cb2-9a68-ff18a5fa2c64
Zobrazit plný text záznamu
3
Local search for Steiner tree problems in graphs
Autor: Verhoeven, M.G.A., Severens, M.E.M., Aarts, E.H.L., Rayward-Smith, V.J., Reeves, C.R., Smith, G.D.
Publikováno v: Modern Heuristic Search Methods, 117-129
STARTPAGE=117;ENDPAGE=129;TITLE=Modern Heuristic Search Methods
We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::743cf8bd6f9309c83d1c76f563837b87
https://research.tue.nl/nl/publications/9153ce27-004c-4dea-aaea-db8593906c1f
Zobrazit plný text záznamu
5
A probabilistic analysis of local search
Autor: Eikelder, ten, H.M.M., Verhoeven, M.G.A., Vossen, T.W.M., Aarts, E.H.L., Osman, I.H., Kelly, J.P.
Publikováno v: Meta-heuristics : theory and applications, 605-618
STARTPAGE=605;ENDPAGE=618;TITLE=Meta-heuristics : theory and applications
We present a theoretical average-case analysis of a 2-opt algorithm for the traveling salesman problem. First, we give a model which allows us to compute the required number of steps and the distribution of final solutions found by a best improvement
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::afe5871999cac6f4e302367ed923507a
https://research.tue.nl/nl/publications/f62ebb3c-8b49-43ba-8dc4-7376d30397d8
Zobrazit plný text záznamu
7
Parallel local search and job shop scheduling
Autor: Verhoeven, M.G.A., Aarts, E.H.L., Ferreira, A., Rolim, J.D.P.
Publikováno v: Parallel Algorithms for Irregular Problems : State of the Art, 195-212
STARTPAGE=195;ENDPAGE=212;TITLE=Parallel Algorithms for Irregular Problems : State of the Art
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::ce8e45a91524671a3e622fb0b69378de
https://research.tue.nl/nl/publications/09e41f6e-c06f-4ecb-bb48-3b1baeb5cca1
Zobrazit plný text záznamu
8
Local search for the Steiner tree problem in graphs
Autor: Verhoeven, M.G.A., Aarts, E.H.L., Severens, M.E.M.
Publikováno v: Proceedings of the International Conference on Applied Decision Technologies (London, UK, April 3-5, 1995), 345-351
STARTPAGE=345;ENDPAGE=351;TITLE=Proceedings of the International Conference on Applied Decision Technologies (London, UK, April 3-5, 1995)
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::6ea9caf0b8a37077885f74f3830a8036
https://research.tue.nl/nl/publications/804d0aca-efdd-4085-a77b-745f7e4b53d3
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje