Search dblp for Publications

export results for "toc:db/journals/heuristics/heuristics17.bht:"

 download as .bib file

@article{DBLP:journals/heuristics/AloiseR11,
  author       = {Daniel Aloise and
                  Celso C. Ribeiro},
  title        = {Adaptive memory in multistart heuristics for multicommodity network
                  design},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {2},
  pages        = {153--179},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9130-6},
  doi          = {10.1007/S10732-010-9130-6},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/AloiseR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/AnsoteguiBFGM11,
  author       = {Carlos Ans{\'{o}}tegui and
                  Ram{\'{o}}n B{\'{e}}jar and
                  C{\`{e}}sar Fern{\'{a}}ndez and
                  Carla P. Gomes and
                  Carles Mateu},
  title        = {Generating highly balanced sudoku problems as hard problems},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {589--614},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9146-y},
  doi          = {10.1007/S10732-010-9146-Y},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/AnsoteguiBFGM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/BansalS11,
  author       = {Richa Bansal and
                  Kamal Srivastava},
  title        = {Memetic algorithm for the antibandwidth maximization problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {1},
  pages        = {39--60},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9124-4},
  doi          = {10.1007/S10732-010-9124-4},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/BansalS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/BengoetxeaLBP11,
  author       = {Endika Bengoetxea and
                  Pedro Larra{\~{n}}aga and
                  Concha Bielza and
                  Juan A. Fern{\'{a}}ndez del Pozo},
  title        = {Optimal row and column ordering to improve table interpretation using
                  estimation of distribution algorithms},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {567--588},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9145-z},
  doi          = {10.1007/S10732-010-9145-Z},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/BengoetxeaLBP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/BrueggemannH11,
  author       = {Tobias Br{\"{u}}ggemann and
                  Johann L. Hurink},
  title        = {Matching based very large-scale neighborhoods for parallel machine
                  scheduling},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {6},
  pages        = {637--658},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9149-8},
  doi          = {10.1007/S10732-010-9149-8},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/BrueggemannH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/DeinekoSS11,
  author       = {Vladimir G. Deineko and
                  Dvir Shabtay and
                  George Steiner},
  title        = {On the asymptotic behavior of subtour-patching heuristics in solving
                  the {TSP} on permuted Monge matrices},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {1},
  pages        = {61--96},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9127-1},
  doi          = {10.1007/S10732-010-9127-1},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/DeinekoSS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/DengB11,
  author       = {Yumin Deng and
                  Jonathan F. Bard},
  title        = {A reactive {GRASP} with path relinking for capacitated clustering},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {2},
  pages        = {119--152},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9129-z},
  doi          = {10.1007/S10732-010-9129-Z},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/DengB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/DotuPBGM11,
  author       = {Iv{\'{a}}n Dot{\'{u}} and
                  Miguel A. Patricio and
                  Antonio Berlanga and
                  Jes{\'{u}}s Garc{\'{\i}}a and
                  Jos{\'{e}} M. Molina},
  title        = {Boosting video tracking performance by means of Tabu Search in intelligent
                  visual surveillance systems},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {4},
  pages        = {415--440},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9140-4},
  doi          = {10.1007/S10732-010-9140-4},
  timestamp    = {Tue, 12 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/DotuPBGM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/FadlaouiG11,
  author       = {Kamal Fadlaoui and
                  Philippe Galinier},
  title        = {A tabu search algorithm for the covering design problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {6},
  pages        = {659--674},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9150-2},
  doi          = {10.1007/S10732-010-9150-2},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/FadlaouiG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/GilliS11,
  author       = {Manfred Gilli and
                  Enrico Schumann},
  title        = {Optimal enough?},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {4},
  pages        = {373--387},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9138-y},
  doi          = {10.1007/S10732-010-9138-Y},
  timestamp    = {Tue, 26 Jun 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/GilliS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/GoncalvesR11,
  author       = {Jos{\'{e}} Fernando Gon{\c{c}}alves and
                  Mauricio G. C. Resende},
  title        = {Biased random-key genetic algorithms for combinatorial optimization},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {487--525},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9143-1},
  doi          = {10.1007/S10732-010-9143-1},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/GoncalvesR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/GoncalvesRM11,
  author       = {Jos{\'{e}} Fernando Gon{\c{c}}alves and
                  Mauricio G. C. Resende and
                  Jorge Jos{\'{e}} de Magalh{\~{a}}es Mendes},
  title        = {A biased random-key genetic algorithm with forward-backward improvement
                  for the resource constrained project scheduling problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {467--486},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9142-2},
  doi          = {10.1007/S10732-010-9142-2},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/GoncalvesRM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/GouveiaPS11,
  author       = {Luis Eduardo Neves Gouveia and
                  Ana Paias and
                  Dushyant Sharma},
  title        = {Restricted dynamic programming based neighborhoods for the hop-constrained
                  minimum spanning tree problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {1},
  pages        = {23--37},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-009-9123-5},
  doi          = {10.1007/S10732-009-9123-5},
  timestamp    = {Mon, 21 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/GouveiaPS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/HamadiR11,
  author       = {Youssef Hamadi and
                  Georg Ringwelski},
  title        = {Boosting distributed constraint satisfaction},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {3},
  pages        = {251--279},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9134-2},
  doi          = {10.1007/S10732-010-9134-2},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/HamadiR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/KarapetyanG11,
  author       = {Daniel Karapetyan and
                  Gregory Z. Gutin},
  title        = {Local search heuristics for the multidimensional assignment problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {3},
  pages        = {201--249},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9133-3},
  doi          = {10.1007/S10732-010-9133-3},
  timestamp    = {Thu, 22 Feb 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/KarapetyanG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/LaarhovenO11,
  author       = {Jon W. Van Laarhoven and
                  Jeffrey W. Ohlmann},
  title        = {A randomized Delaunay triangulation heuristic for the Euclidean Steiner
                  tree problem in \emph{{\(\mathfrak{R}\)}}\({}^{\mbox{\emph{d}}}\)},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {4},
  pages        = {353--372},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9137-z},
  doi          = {10.1007/S10732-010-9137-Z},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/LaarhovenO11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/LabadiMC11,
  author       = {Nacima Labadi and
                  Jan Melechovsk{\'{y}} and
                  Roberto Wolfler Calvo},
  title        = {Hybridized evolutionary local search algorithm for the team orienteering
                  problem with time windows},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {6},
  pages        = {729--753},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9153-z},
  doi          = {10.1007/S10732-010-9153-Z},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/LabadiMC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/LeoneFM11,
  author       = {Renato De Leone and
                  Paola Festa and
                  Emilia Marchitto},
  title        = {A Bus Driver Scheduling Problem: a new mathematical model and a {GRASP}
                  approximate solution},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {4},
  pages        = {441--466},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9141-3},
  doi          = {10.1007/S10732-010-9141-3},
  timestamp    = {Tue, 06 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/LeoneFM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/LinQF11,
  author       = {Chuan Lin and
                  Anyong Qing and
                  Quanyuan Feng},
  title        = {A comparative study of crossover in differential evolution},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {6},
  pages        = {675--703},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9151-1},
  doi          = {10.1007/S10732-010-9151-1},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/LinQF11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/LuHG11,
  author       = {Zhipeng L{\"{u}} and
                  Jin{-}Kao Hao and
                  Fred W. Glover},
  title        = {Neighborhood analysis: a case study on curriculum-based course timetabling},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {2},
  pages        = {97--118},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9128-0},
  doi          = {10.1007/S10732-010-9128-0},
  timestamp    = {Tue, 04 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/LuHG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/MateusRS11,
  author       = {Geraldo R. Mateus and
                  Mauricio G. C. Resende and
                  Ricardo M. A. Silva},
  title        = {{GRASP} with path-relinking for the generalized quadratic assignment
                  problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {527--565},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9144-0},
  doi          = {10.1007/S10732-010-9144-0},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/MateusRS11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/OuzinebNG11,
  author       = {Mohamed Ouzineb and
                  Mustapha Nourelfath and
                  Michel Gendreau},
  title        = {A heuristic method for non-homogeneous redundancy optimization of
                  series-parallel multi-state systems},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {1},
  pages        = {1--22},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-009-9117-3},
  doi          = {10.1007/S10732-009-9117-3},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/OuzinebNG11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/PalettaV11,
  author       = {Giuseppe Paletta and
                  Francesca Vocaturo},
  title        = {A composite algorithm for multiprocessor scheduling},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {3},
  pages        = {281--301},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9135-1},
  doi          = {10.1007/S10732-010-9135-1},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/PalettaV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/PeteghemV11,
  author       = {Vincent Van Peteghem and
                  Mario Vanhoucke},
  title        = {Using resource scarceness characteristics to solve the multi-mode
                  resource-constrained project scheduling problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {6},
  pages        = {705--728},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9152-0},
  doi          = {10.1007/S10732-010-9152-0},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/PeteghemV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/PullanMB11,
  author       = {Wayne Pullan and
                  Franco Mascia and
                  Mauro Brunato},
  title        = {Cooperating local search for the maximum clique problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {2},
  pages        = {181--199},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9131-5},
  doi          = {10.1007/S10732-010-9131-5},
  timestamp    = {Thu, 18 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/PullanMB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/RiiseB11,
  author       = {Atle Riise and
                  Edmund K. Burke},
  title        = {Local search for the surgery admission planning problem},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {4},
  pages        = {389--414},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9139-x},
  doi          = {10.1007/S10732-010-9139-X},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/RiiseB11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/TorilWMW11,
  author       = {Mat{\'{\i}}as Toril and
                  Volker Wille and
                  {\'{I}}{\~{n}}igo Molina{-}Fern{\'{a}}ndez and
                  Chris Walshaw},
  title        = {An adaptive multi-start graph partitioning algorithm for structuring
                  cellular networks},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {5},
  pages        = {615--635},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9148-9},
  doi          = {10.1007/S10732-010-9148-9},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/heuristics/TorilWMW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/heuristics/Zhang11,
  author       = {Gexiang Zhang},
  title        = {Quantum-inspired evolutionary algorithms: a survey and empirical study},
  journal      = {J. Heuristics},
  volume       = {17},
  number       = {3},
  pages        = {303--351},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10732-010-9136-0},
  doi          = {10.1007/S10732-010-9136-0},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/heuristics/Zhang11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.