Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/heuristics/heuristics14.bht:"
@article{DBLP:journals/heuristics/AlbaTN08, author = {Enrique Alba and El{-}Ghazali Talbi and Antonio J. Nebro}, title = {Guest Editorial}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {311--312}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9039-x}, doi = {10.1007/S10732-007-9039-X}, timestamp = {Wed, 13 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/AlbaTN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/AlidaeeKW08, author = {Bahram Alidaee and Gary A. Kochenberger and Haibo Wang}, title = {Simple and fast surrogate constraint heuristics for the maximum independent set problem}, journal = {J. Heuristics}, volume = {14}, number = {6}, pages = {571--585}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9054-y}, doi = {10.1007/S10732-007-9054-Y}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/AlidaeeKW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/BianchiRC08, author = {Reinaldo A. C. Bianchi and Carlos H. C. Ribeiro and Anna Helena Reali Costa}, title = {Accelerating autonomous learning by using heuristic selection of actions}, journal = {J. Heuristics}, volume = {14}, number = {2}, pages = {135--168}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9031-5}, doi = {10.1007/S10732-007-9031-5}, timestamp = {Fri, 04 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/BianchiRC08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Boschetti08, author = {Fabio Boschetti}, title = {A local linear embedding module for evolutionary computation optimization}, journal = {J. Heuristics}, volume = {14}, number = {1}, pages = {95--116}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9030-6}, doi = {10.1007/S10732-007-9030-6}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Boschetti08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/BrankeMS08, author = {J{\"{u}}rgen Branke and Stephan Meisel and Christian Schmidt}, title = {Simulated annealing in the presence of noise}, journal = {J. Heuristics}, volume = {14}, number = {6}, pages = {627--654}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9058-7}, doi = {10.1007/S10732-007-9058-7}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/BrankeMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/BrimbergMU08, author = {Jack Brimberg and Nenad Mladenovic and Dragan Urosevic}, title = {Local and variable neighborhood search for the \emph{k} -cardinality subgraph problem}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {501--517}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9046-y}, doi = {10.1007/S10732-007-9046-Y}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/BrimbergMU08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/EastonS08, author = {Todd Easton and Abhilash Singireddy}, title = {A large neighborhood search heuristic for the longest common subsequence problem}, journal = {J. Heuristics}, volume = {14}, number = {3}, pages = {271--283}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9038-y}, doi = {10.1007/S10732-007-9038-Y}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/EastonS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/EskandariG08, author = {Hamidreza Eskandari and Christopher D. Geiger}, title = {A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems}, journal = {J. Heuristics}, volume = {14}, number = {3}, pages = {203--241}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9037-z}, doi = {10.1007/S10732-007-9037-Z}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/EskandariG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/FraminanP08, author = {Jose M. Frami{\~{n}}an and Rafael Pastor}, title = {A proposal for a hybrid meta-strategy for combinatorial optimization problems}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {375--390}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9056-9}, doi = {10.1007/S10732-007-9056-9}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/FraminanP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Garcia-PedrajasF08, author = {Nicol{\'{a}}s Garc{\'{\i}}a{-}Pedrajas and Colin Fyfe}, title = {Construction of classifier ensembles by means of artificial immune systems}, journal = {J. Heuristics}, volume = {14}, number = {3}, pages = {285--310}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9036-0}, doi = {10.1007/S10732-007-9036-0}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Garcia-PedrajasF08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GoldenRS08, author = {Bruce L. Golden and S. Raghavan and Daliborka Stanojevic}, title = {The prize-collecting generalized minimum spanning tree problem}, journal = {J. Heuristics}, volume = {14}, number = {1}, pages = {69--93}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9027-1}, doi = {10.1007/S10732-007-9027-1}, timestamp = {Sat, 13 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/GoldenRS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GreistorferLVW08, author = {Peter Greistorfer and Arne L{\o}kketangen and Stefan Vo{\ss} and David L. Woodruff}, title = {Experiments concerning sequential versus simultaneous maximization of objective function and distance}, journal = {J. Heuristics}, volume = {14}, number = {6}, pages = {613--625}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9053-z}, doi = {10.1007/S10732-007-9053-Z}, timestamp = {Wed, 14 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/GreistorferLVW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GrossoLP08, author = {Andrea Grosso and Marco Locatelli and Wayne J. Pullan}, title = {Simple ingredients leading to very efficient heuristics for the maximum clique problem}, journal = {J. Heuristics}, volume = {14}, number = {6}, pages = {587--612}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9055-x}, doi = {10.1007/S10732-007-9055-X}, timestamp = {Tue, 07 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/GrossoLP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GutinGH08, author = {Gregory Z. Gutin and Boris Goldengorin and Jing Huang}, title = {Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems}, journal = {J. Heuristics}, volume = {14}, number = {2}, pages = {169--181}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9033-3}, doi = {10.1007/S10732-007-9033-3}, timestamp = {Wed, 19 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/GutinGH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/HuLR08, author = {Bin Hu and Markus Leitner and G{\"{u}}nther R. Raidl}, title = {Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {473--499}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9047-x}, doi = {10.1007/S10732-007-9047-X}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/HuLR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/KimLH08, author = {Youngjin Kim and Youngho Lee and Junghee Han}, title = {A ring-mesh topology design problem for optical transport networks}, journal = {J. Heuristics}, volume = {14}, number = {2}, pages = {183--202}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9034-2}, doi = {10.1007/S10732-007-9034-2}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/KimLH08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Kulturel-KonakCB08, author = {Sadan Kulturel{-}Konak and David W. Coit and Fatema Baheranwala}, title = {Pruned Pareto-optimal sets for the system redundancy allocation problem based on multiple prioritized objectives}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {335--357}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9041-3}, doi = {10.1007/S10732-007-9041-3}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Kulturel-KonakCB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/LiK08, author = {Minqiang Li and Jisong Kou}, title = {Crowding with nearest neighbors replacement for multiple species niching and building blocks preservation in binary multimodal functions optimization}, journal = {J. Heuristics}, volume = {14}, number = {3}, pages = {243--270}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9035-1}, doi = {10.1007/S10732-007-9035-1}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/LiK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/MalikRCB08, author = {Abid M. Malik and Tyrel Russell and Michael Chase and Peter van Beek}, title = {Learning heuristics for basic block instruction scheduling}, journal = {J. Heuristics}, volume = {14}, number = {6}, pages = {549--569}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9051-1}, doi = {10.1007/S10732-007-9051-1}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/MalikRCB08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Moreno-VegaM08, author = {J. Marcos Moreno{-}Vega and Bel{\'{e}}n Meli{\'{a}}n}, title = {Introduction to the special issue on variable neighborhood search}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {403--404}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9044-0}, doi = {10.1007/S10732-007-9044-0}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Moreno-VegaM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Nikulin08, author = {Yury Nikulin}, title = {Simulated annealing algorithm for the robust spanning tree problem}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {391--402}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9057-8}, doi = {10.1007/S10732-007-9057-8}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Nikulin08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/ParaskevopoulosRTIP08, author = {Dimitris C. Paraskevopoulos and Panagiotis P. Repoussis and Christos D. Tarantilis and George Ioannou and Gregory P. Prastacos}, title = {A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {425--455}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9045-z}, doi = {10.1007/S10732-007-9045-Z}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/ParaskevopoulosRTIP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/PatoM08, author = {Margarida Vaz Pato and Margarida Moz}, title = {Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {359--374}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9040-4}, doi = {10.1007/S10732-007-9040-4}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/PatoM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/PolacekDHM08, author = {Michael Polacek and Karl F. Doerner and Richard F. Hartl and Vittorio Maniezzo}, title = {A variable neighborhood search for the capacitated arc routing problem with intermediate facilities}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {405--423}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9050-2}, doi = {10.1007/S10732-007-9050-2}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/PolacekDHM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/PuchingerR08, author = {Jakob Puchinger and G{\"{u}}nther R. Raidl}, title = {Bringing order into the neighborhoods: relaxation guided variable neighborhood search}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {457--472}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9048-9}, doi = {10.1007/S10732-007-9048-9}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/PuchingerR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Pullan08, author = {Wayne J. Pullan}, title = {Approximating the maximum vertex/edge weighted clique using local search}, journal = {J. Heuristics}, volume = {14}, number = {2}, pages = {117--134}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9026-2}, doi = {10.1007/S10732-007-9026-2}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Pullan08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Raisanen08, author = {Larry Raisanen}, title = {A permutation-coded evolutionary strategy for multi-objective {GSM} network planning}, journal = {J. Heuristics}, volume = {14}, number = {1}, pages = {1--21}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9024-4}, doi = {10.1007/S10732-007-9024-4}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Raisanen08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/SadlerG08, author = {Andrew John Sadler and Carmen Gervet}, title = {Enhancing set constraint solvers with lexicographic bounds}, journal = {J. Heuristics}, volume = {14}, number = {1}, pages = {23--67}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9028-0}, doi = {10.1007/S10732-007-9028-0}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/SadlerG08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/SantanaLL08, author = {Roberto Santana and Pedro Larra{\~{n}}aga and Jos{\'{e}} Antonio Lozano}, title = {Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem}, journal = {J. Heuristics}, volume = {14}, number = {5}, pages = {519--547}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9049-8}, doi = {10.1007/S10732-007-9049-8}, timestamp = {Fri, 23 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/SantanaLL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/ZinflouGGP08, author = {Arnaud Zinflou and Caroline Gagn{\'{e}} and Marc Gravel and Wilson L. Price}, title = {Pareto memetic algorithm for multiple objective optimization with an industrial application}, journal = {J. Heuristics}, volume = {14}, number = {4}, pages = {313--333}, year = {2008}, url = {https://doi.org/10.1007/s10732-007-9042-2}, doi = {10.1007/S10732-007-9042-2}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/ZinflouGGP08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.