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 794 matches
- 2024
- Guilherme Barbosa de Almeida, Elisangela Martins de Sá, Sérgio Ricardo de Souza, Marcone Jamilson Freitas Souza:
A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems. J. Heuristics 30(3-4): 145-172 (2024) - Louis Carpentier, Jorik Jooken, Jan Goedgebeur:
A heuristic algorithm using tree decompositions for the maximum happy vertices problem. J. Heuristics 30(1-2): 67-107 (2024) - Giuseppe Lancia, Marcello Dalpasso:
Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood. J. Heuristics 30(3-4): 109-144 (2024) - Yeray Galán López, Cristian González García, Vicente García-Díaz, Edward Rolando Núñez-Valdéz, Alberto Gómez Gómez:
Interpretability of rectangle packing solutions with Monte Carlo tree search. J. Heuristics 30(3-4): 173-198 (2024) - Ebrahim Teimoury, Reza Rashid:
A hybrid variable neighborhood search heuristic for the sustainable time-dependent truck-drone routing problem with rendezvous locations. J. Heuristics 30(1-2): 1-41 (2024) - Xinliang Tian, Dantong Ouyang, Huisi Zhou, Rui Sun, Liming Zhang:
DSLS: a simple and efficient local search algorithm for the maximum bisection problem. J. Heuristics 30(1-2): 43-65 (2024) - Sandra Mara Guse Scós Venske, Carolina Paula de Almeida, Myriam Regattieri Delgado:
Metaheuristics and machine learning: an approach with reinforcement learning assisting neural architecture search. J. Heuristics 30(3-4): 199-224 (2024) - 2023
- Mohamad Alissa, Kevin Sim, Emma Hart:
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches. J. Heuristics 29(1): 1-38 (2023) - João Luiz Marques de Andrade, Gustavo Campos Menezes:
A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports. J. Heuristics 29(1): 39-76 (2023) - Fatma Zohra Baatout, Mhand Hifi:
A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors. J. Heuristics 29(2-3): 229-267 (2023) - Hanyu Gu, Hue Chi Lam, Thi Thanh Thu Pham, Yakov Zinder:
Heuristics and meta-heuristic to solve the ROADEF/EURO challenge 2020 maintenance planning problem. J. Heuristics 29(1): 139-175 (2023) - Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani:
Learning fine-grained search space pruning and heuristics for combinatorial optimization. J. Heuristics 29(2-3): 313-347 (2023) - Fagui Liu, Lvshengbiao Wang, Mengke Gui, Yang Zhang, Yulin Lan, Chengqi Lai, Boyuan Zhu:
A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window. J. Heuristics 29(2-3): 269-311 (2023) - Miguel S. E. Martins, Joaquim L. Viegas, Tiago Coito, Bernardo M. Firme, Andrea Costigliola, João Figueiredo, Susana M. Vieira, João M. C. Sousa:
Minimizing total completion time in large-sized pharmaceutical quality control scheduling. J. Heuristics 29(1): 177-206 (2023) - Majid Namazi, M. A. Hakim Newton, Conrad Sanderson, Abdul Sattar:
Solving travelling thief problems using coordination based methods. J. Heuristics 29(4-6): 487-544 (2023) - Abtin Nourmohammadzadeh, Malek Sarhani, Stefan Voß:
A matheuristic approach for the family traveling salesman problem. J. Heuristics 29(4-6): 435-460 (2023) - Mohamed-Amine Ouberkouk, Jean-Paul Boufflet, Aziz Moukrim:
Effective adaptive large neighborhood search for a firefighters timetabling problem. J. Heuristics 29(4-6): 545-580 (2023) - Fatemeh Sarayloo, Teodor Gabriel Crainic, Walter Rei:
An integrated learning and progressive hedging matheuristic for stochastic network design problem. J. Heuristics 29(4-6): 409-434 (2023) - Michel Vasquez, Mirsad Buljubasic, Saïd Hanafi:
An efficient scenario penalization matheuristic for a stochastic scheduling problem. J. Heuristics 29(2-3): 383-408 (2023) - Bijun Wang, Zheyong Bian, Mo Mansouri:
Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system. J. Heuristics 29(1): 77-137 (2023) - Jan Wehner, Michael Sioutis, Diedrich Wolter:
On robust vs fast solving of qualitative constraints. J. Heuristics 29(4-6): 461-485 (2023) - David Woller, Jakub Rada, Miroslav Kulich:
The ALNS metaheuristic for the transmission maintenance scheduling. J. Heuristics 29(2-3): 349-382 (2023) - Pengfei Zhou, Li Lin, Kap Hwan Kim:
Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals. J. Heuristics 29(2-3): 207-228 (2023) - 2022
- Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia, Eduard Torres:
Incomplete MaxSAT approaches for combinatorial testing. J. Heuristics 28(4): 377-431 (2022) - Alexander E. I. Brownlee, Michael G. Epitropakis, Jeroen Mulder, Marc Paelinck, Edmund K. Burke:
A systematic approach to parameter optimization and its application to flight schedule simulation software. J. Heuristics 28(4): 509-538 (2022) - Alejandra Casado, Sergio Pérez-Peló, Jesús Sánchez-Oro, Abraham Duarte:
A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem. J. Heuristics 28(1): 121-146 (2022) - Francisco Casas, Claudio E. Torres, Ignacio Araya:
A heuristic search based on diversity for solving combinatorial problems. J. Heuristics 28(3): 287-328 (2022) - Daiane Maria De Genaro Chiroli, Sérgio Fernando Mayerle, João Neiva de Figueiredo:
Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints. J. Heuristics 28(1): 23-59 (2022) - Leandro Rincon Costa, Daniel Aloise, Luca Giovanni Gianoli, Andrea Lodi:
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds. J. Heuristics 28(4): 539-582 (2022) - Dien Dinh, Le Thanh Nguyen:
English-Vietnamese cross-language paraphrase identification using hybrid feature classes. J. Heuristics 28(2): 193-209 (2022)
skipping 764 more matches
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-10-06 03:15 CEST 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