default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Heuristics, Volume 14
Volume 14, Number 1, February 2008
- Larry Raisanen:
A permutation-coded evolutionary strategy for multi-objective GSM network planning. 1-21 - Andrew John Sadler, Carmen Gervet:
Enhancing set constraint solvers with lexicographic bounds. 23-67 - Bruce L. Golden, S. Raghavan, Daliborka Stanojevic:
The prize-collecting generalized minimum spanning tree problem. 69-93 - Fabio Boschetti:
A local linear embedding module for evolutionary computation optimization. 95-116
Volume 14, Number 2, April 2008
- Wayne J. Pullan:
Approximating the maximum vertex/edge weighted clique using local search. 117-134 - Reinaldo A. C. Bianchi
, Carlos H. C. Ribeiro, Anna Helena Reali Costa:
Accelerating autonomous learning by using heuristic selection of actions. 135-168 - Gregory Z. Gutin, Boris Goldengorin, Jing Huang:
Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems. 169-181 - Youngjin Kim, Youngho Lee, Junghee Han:
A ring-mesh topology design problem for optical transport networks. 183-202
Volume 14, Number 3, June 2008
- Hamidreza Eskandari, Christopher D. Geiger:
A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems. 203-241 - Minqiang Li, Jisong Kou:
Crowding with nearest neighbors replacement for multiple species niching and building blocks preservation in binary multimodal functions optimization. 243-270 - Todd Easton, Abhilash Singireddy:
A large neighborhood search heuristic for the longest common subsequence problem. 271-283 - Nicolás García-Pedrajas, Colin Fyfe:
Construction of classifier ensembles by means of artificial immune systems. 285-310
Volume 14, Number 4, August 2008
- Enrique Alba, El-Ghazali Talbi, Antonio J. Nebro:
Guest Editorial. 311-312 - Arnaud Zinflou, Caroline Gagné, Marc Gravel, Wilson L. Price:
Pareto memetic algorithm for multiple objective optimization with an industrial application. 313-333 - Sadan Kulturel-Konak, David W. Coit, Fatema Baheranwala:
Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives. 335-357 - Margarida Vaz Pato, Margarida Moz:
Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic. 359-374 - Jose M. Framiñan, Rafael Pastor:
A proposal for a hybrid meta-strategy for combinatorial optimization problems. 375-390 - Yury Nikulin:
Simulated annealing algorithm for the robust spanning tree problem. 391-402
Volume 14, Number 5, October 2008
- J. Marcos Moreno-Vega, Belén Melián:
Introduction to the special issue on variable neighborhood search. 403-404 - Michael Polacek, Karl F. Doerner, Richard F. Hartl, Vittorio Maniezzo:
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. 405-423 - Dimitris C. Paraskevopoulos, Panagiotis P. Repoussis, Christos D. Tarantilis, George Ioannou, Gregory P. Prastacos:
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. 425-455 - Jakob Puchinger, Günther R. Raidl:
Bringing order into the neighborhoods: relaxation guided variable neighborhood search. 457-472 - Bin Hu, Markus Leitner, Günther R. Raidl:
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. 473-499 - Jack Brimberg, Nenad Mladenovic, Dragan Urosevic:
Local and variable neighborhood search for the k -cardinality subgraph problem. 501-517 - Roberto Santana, Pedro Larrañaga, José Antonio Lozano:
Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. 519-547
Volume 14, Number 6, December 2008
- Abid M. Malik, Tyrel Russell, Michael Chase, Peter van Beek:
Learning heuristics for basic block instruction scheduling. 549-569 - Bahram Alidaee, Gary A. Kochenberger, Haibo Wang:
Simple and fast surrogate constraint heuristics for the maximum independent set problem. 571-585 - Andrea Grosso, Marco Locatelli, Wayne J. Pullan:
Simple ingredients leading to very efficient heuristics for the maximum clique problem. 587-612 - Peter Greistorfer, Arne Løkketangen, Stefan Voß, David L. Woodruff:
Experiments concerning sequential versus simultaneous maximization of objective function and distance. 613-625 - Jürgen Branke, Stephan Meisel, Christian Schmidt:
Simulated annealing in the presence of noise. 627-654
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-30 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
