![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/heuristics/heuristics23.bht:"
@article{DBLP:journals/heuristics/AlamNS17, author = {Md. Masbaul Alam and M. A. Hakim Newton and Abdul Sattar}, title = {Constraint-based search for optimal Golomb rulers}, journal = {J. Heuristics}, volume = {23}, number = {6}, pages = {501--532}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9353-x}, doi = {10.1007/S10732-017-9353-X}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/AlamNS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Anton-SanchezBL17, author = {Laura Anton{-}Sanchez and Concha Bielza and Pedro Larra{\~{n}}aga}, title = {Network design through forests with degree- and role-constrained minimum spanning trees}, journal = {J. Heuristics}, volume = {23}, number = {1}, pages = {31--51}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9323-3}, doi = {10.1007/S10732-017-9323-3}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/Anton-SanchezBL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/BoardmanLR17, author = {Nicholas T. Boardman and Brian J. Lunday and Matthew J. Robbins}, title = {Heterogeneous surface-to-air missile defense battery location: a game theoretic approach}, journal = {J. Heuristics}, volume = {23}, number = {6}, pages = {417--447}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9350-0}, doi = {10.1007/S10732-017-9350-0}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/BoardmanLR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/CerqueusGPS17, author = {Audrey Cerqueus and Xavier Gandibleux and Anthony Przybylski and Fr{\'{e}}d{\'{e}}ric Saubion}, title = {On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem}, journal = {J. Heuristics}, volume = {23}, number = {5}, pages = {285--319}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9346-9}, doi = {10.1007/S10732-017-9346-9}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/CerqueusGPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/FariaRE17, author = {Haroldo de Faria Jr. and Mauricio G. C. Resende and Damien Ernst}, title = {A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem}, journal = {J. Heuristics}, volume = {23}, number = {6}, pages = {533--550}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9355-8}, doi = {10.1007/S10732-017-9355-8}, timestamp = {Sat, 04 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/FariaRE17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/Garcia-DiazSMM17, author = {Jesus Garcia{-}Diaz and Jairo Javier Sanchez{-}Hernandez and Ricardo Menchaca{-}Mendez and Rolando Menchaca{-}M{\'{e}}ndez}, title = {When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem}, journal = {J. Heuristics}, volume = {23}, number = {5}, pages = {349--366}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9345-x}, doi = {10.1007/S10732-017-9345-X}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/Garcia-DiazSMM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GharotePL17, author = {Mangesh S. Gharote and Rahul Patil and Sachin Lodha}, title = {Scatter search for trainees to software project requirements stable allocation}, journal = {J. Heuristics}, volume = {23}, number = {4}, pages = {257--283}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9343-z}, doi = {10.1007/S10732-017-9343-Z}, timestamp = {Thu, 27 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/GharotePL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GlorieuxSDL17, author = {Emile Glorieux and Bo Svensson and Fredrik Danielsson and Bengt Lennartson}, title = {Constructive cooperative coevolution for large-scale global optimisation}, journal = {J. Heuristics}, volume = {23}, number = {6}, pages = {449--469}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9351-z}, doi = {10.1007/S10732-017-9351-Z}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/GlorieuxSDL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/GonzalezPVH17, author = {Miguel A. Gonz{\'{a}}lez and Juan Jos{\'{e}} Palacios and Camino R. Vela and Alejandro Hern{\'{a}}ndez{-}Arauzo}, title = {Scatter search for minimizing weighted tardiness in a single machine scheduling with setups}, journal = {J. Heuristics}, volume = {23}, number = {2-3}, pages = {81--110}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9325-1}, doi = {10.1007/S10732-017-9325-1}, timestamp = {Tue, 25 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/GonzalezPVH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/HanafiT17, author = {Sa{\"{\i}}d Hanafi and Raca Todosijevic}, title = {Mathematical programming based heuristics for the 0-1 {MIP:} a survey}, journal = {J. Heuristics}, volume = {23}, number = {4}, pages = {165--206}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9336-y}, doi = {10.1007/S10732-017-9336-Y}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/HanafiT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/JovanovicNV17, author = {Raka Jovanovic and Tatsushi Nishi and Stefan Vo{\ss}}, title = {A heuristic approach for dividing graphs into bi-connected components with a size constraint}, journal = {J. Heuristics}, volume = {23}, number = {2-3}, pages = {111--136}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9331-3}, doi = {10.1007/S10732-017-9331-3}, timestamp = {Thu, 29 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/JovanovicNV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/LammSSSW17, author = {Sebastian Lamm and Peter Sanders and Christian Schulz and Darren Strash and Renato F. Werneck}, title = {Finding near-optimal independent sets at scale}, journal = {J. Heuristics}, volume = {23}, number = {4}, pages = {207--229}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9337-x}, doi = {10.1007/S10732-017-9337-X}, timestamp = {Fri, 27 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/LammSSSW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/MontielD17, author = {Luis Montiel and Roussos G. Dimitrakopoulos}, title = {A heuristic approach for the stochastic optimization of mine production schedules}, journal = {J. Heuristics}, volume = {23}, number = {5}, pages = {397--415}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9349-6}, doi = {10.1007/S10732-017-9349-6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/MontielD17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/OyeboluJSFAB17, author = {Folarin B. Oyebolu and Jeroen van Lidth de Jeude and Cyrus Siganporia and Suzanne S. Farid and Richard Allmendinger and J{\"{u}}rgen Branke}, title = {A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production}, journal = {J. Heuristics}, volume = {23}, number = {4}, pages = {231--256}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9338-9}, doi = {10.1007/S10732-017-9338-9}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/OyeboluJSFAB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/ShiG17, author = {Min Shi and Shang Gao}, title = {Reference sharing: a new collaboration model for cooperative coevolution}, journal = {J. Heuristics}, volume = {23}, number = {1}, pages = {1--30}, year = {2017}, url = {https://doi.org/10.1007/s10732-016-9322-9}, doi = {10.1007/S10732-016-9322-9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/ShiG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/VargasJN17, author = {Leticia Vargas and Nicolas Jozefowiez and Sandra Ulrich Ngueveu}, title = {A dynamic programming operator for tour location problems applied to the covering tour problem}, journal = {J. Heuristics}, volume = {23}, number = {1}, pages = {53--80}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9324-2}, doi = {10.1007/S10732-017-9324-2}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/VargasJN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/XiaoK17, author = {Yiyong Xiao and Abdullah Konak}, title = {A variable neighborhood search for the network design problem with relays}, journal = {J. Heuristics}, volume = {23}, number = {2-3}, pages = {137--164}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9332-2}, doi = {10.1007/S10732-017-9332-2}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/XiaoK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/XieMKS17, author = {Lin Xie and Marius Merschformann and Natalia Kliewer and Leena Suhl}, title = {Metaheuristics approach for solving personalized crew rostering problem in public bus transit}, journal = {J. Heuristics}, volume = {23}, number = {5}, pages = {321--347}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9348-7}, doi = {10.1007/S10732-017-9348-7}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/XieMKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/XiePB17, author = {Fulin Xie and Chris N. Potts and Tolga Bektas}, title = {Iterated local search for workforce scheduling and routing problems}, journal = {J. Heuristics}, volume = {23}, number = {6}, pages = {471--500}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9347-8}, doi = {10.1007/S10732-017-9347-8}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/heuristics/XiePB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/heuristics/ZhangCLY17, author = {Haochen Zhang and Shaowei Cai and Chuan Luo and Minghao Yin}, title = {An efficient local search algorithm for the winner determination problem}, journal = {J. Heuristics}, volume = {23}, number = {5}, pages = {367--396}, year = {2017}, url = {https://doi.org/10.1007/s10732-017-9344-y}, doi = {10.1007/S10732-017-9344-Y}, timestamp = {Wed, 20 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/heuristics/ZhangCLY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.