default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2017
- Md. Masbaul Alam, M. A. Hakim Newton, Abdul Sattar:
Constraint-based search for optimal Golomb rulers. J. Heuristics 23(6): 501-532 (2017) - Laura Anton-Sanchez, Concha Bielza, Pedro Larrañaga:
Network design through forests with degree- and role-constrained minimum spanning trees. J. Heuristics 23(1): 31-51 (2017) - Nicholas T. Boardman, Brian J. Lunday, Matthew J. Robbins:
Heterogeneous surface-to-air missile defense battery location: a game theoretic approach. J. Heuristics 23(6): 417-447 (2017) - Audrey Cerqueus, Xavier Gandibleux, Anthony Przybylski, Frédéric Saubion:
On branching heuristics for the bi-objective 0/1 unidimensional knapsack problem. J. Heuristics 23(5): 285-319 (2017) - Haroldo de Faria Jr., Mauricio G. C. Resende, Damien Ernst:
A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem. J. Heuristics 23(6): 533-550 (2017) - Jesus Garcia-Diaz, Jairo Javier Sanchez-Hernandez, Ricardo Menchaca-Mendez, Rolando Menchaca-Méndez:
When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem. J. Heuristics 23(5): 349-366 (2017) - Mangesh S. Gharote, Rahul Patil, Sachin Lodha:
Scatter search for trainees to software project requirements stable allocation. J. Heuristics 23(4): 257-283 (2017) - Emile Glorieux, Bo Svensson, Fredrik Danielsson, Bengt Lennartson:
Constructive cooperative coevolution for large-scale global optimisation. J. Heuristics 23(6): 449-469 (2017) - Miguel A. González, Juan José Palacios, Camino R. Vela, Alejandro Hernández-Arauzo:
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups. J. Heuristics 23(2-3): 81-110 (2017) - Saïd Hanafi, Raca Todosijevic:
Mathematical programming based heuristics for the 0-1 MIP: a survey. J. Heuristics 23(4): 165-206 (2017) - Raka Jovanovic, Tatsushi Nishi, Stefan Voß:
A heuristic approach for dividing graphs into bi-connected components with a size constraint. J. Heuristics 23(2-3): 111-136 (2017) - Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. J. Heuristics 23(4): 207-229 (2017) - Luis Montiel, Roussos G. Dimitrakopoulos:
A heuristic approach for the stochastic optimization of mine production schedules. J. Heuristics 23(5): 397-415 (2017) - Folarin B. Oyebolu, Jeroen van Lidth de Jeude, Cyrus Siganporia, Suzanne S. Farid, Richard Allmendinger, Jürgen Branke:
A new lot sizing and scheduling heuristic for multi-site biopharmaceutical production. J. Heuristics 23(4): 231-256 (2017) - Min Shi, Shang Gao:
Reference sharing: a new collaboration model for cooperative coevolution. J. Heuristics 23(1): 1-30 (2017) - Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
A dynamic programming operator for tour location problems applied to the covering tour problem. J. Heuristics 23(1): 53-80 (2017) - Yiyong Xiao, Abdullah Konak:
A variable neighborhood search for the network design problem with relays. J. Heuristics 23(2-3): 137-164 (2017) - Lin Xie, Marius Merschformann, Natalia Kliewer, Leena Suhl:
Metaheuristics approach for solving personalized crew rostering problem in public bus transit. J. Heuristics 23(5): 321-347 (2017) - Fulin Xie, Chris N. Potts, Tolga Bektas:
Iterated local search for workforce scheduling and routing problems. J. Heuristics 23(6): 471-500 (2017) - Haochen Zhang, Shaowei Cai, Chuan Luo, Minghao Yin:
An efficient local search algorithm for the winner determination problem. J. Heuristics 23(5): 367-396 (2017)
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-13 09:23 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint