|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 12 keywords
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 3 | Jens Czogalla, Andreas Fink |
On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem.  |
Metaheuristics for Scheduling in Industrial and Manufacturing Applications  |
2008 |
DBLP DOI BibTeX RDF |
Variable Neighborhood Descent, Particle Swarm Optimization, Hybridization, Genetic Operators, Flow-Shop Scheduling |
| 2 | Zoran Ognjanovic, Uros Midic, Nenad Mladenovic |
A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem.  |
Hybrid Metaheuristics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Xavier Martins, Christophe Duhamel, Philippe Mahey, Rodney Rezende Saldanha, Maurício C. de Souza |
Variable neighborhood descent with iterated local search for routing and wavelength assignment.  |
Computers & OR  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping Chen, Houkuan Huang, Xingye Dong |
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem.  |
Expert Syst. Appl.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin |
A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs.  |
Computers & Industrial Engineering  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rong Qu, Ying Xu, Graham Kendall |
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing.  |
LION  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario Ruthmair, Günther R. Raidl |
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem.  |
EUROCAST  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Prandtstetter, Günther R. Raidl, Thomas Misar |
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse.  |
EvoCOP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Gao, Linyan Sun, Mitsuo Gen |
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems.  |
Computers & OR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping Chen, Youli Qu, Houkuan Huang, Xingye Dong |
A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem.  |
PACIIA  |
2008 |
DBLP DOI BibTeX RDF |
open vehicle routing problem, variable neighborhood descent, iterated local search, hybrid metaheuristic |
| 1 | Sandro Pirkwieser, Günther R. Raidl |
Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms.  |
GECCO  |
2008 |
DBLP DOI BibTeX RDF |
consensus tree problem, memetic algorithm, variable neighborhood search, hybrid methods, phylogenetics |
| 1 | Anand Subramanian, Lucídio dos Anjos Formiga Cabral |
An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.  |
EvoCOP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakob Puchinger, Günther R. Raidl |
Bringing order into the neighborhoods: relaxation guided variable neighborhood search.  |
J. Heuristics  |
2008 |
DBLP DOI BibTeX RDF |
Integer linear programming, Variable neighborhood search, Multidimensional knapsack problem |
| 1 | Pascal Côté, Tony Wong, Robert Sabourin |
A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem.  |
PATAT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Hertz, Michel Mittaz |
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem.  |
Transportation Science  |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|