Остановите войну!
for scientists:
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 27 matches
- 2009
- Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6): 597-615 (2009) - Enrico Bartolini, Aristide Mingozzi:
Algorithms for the non-bifurcated network design problem. J. Heuristics 15(3): 259-281 (2009) - Marco A. Boschetti, Vittorio Maniezzo:
Benders decomposition, Lagrangean relaxation and metaheuristic design. J. Heuristics 15(3): 283-312 (2009) - Ricardo J. G. B. Campello, Eduardo R. Hruschka, Vinicius S. Alves:
On the efficiency of evolutionary fuzzy clustering. J. Heuristics 15(1): 43-75 (2009) - Liliana Capacho, Rafael Pastor, Alexandre Dolgui, Olga Guschinskaya:
An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem. J. Heuristics 15(2): 109-132 (2009) - Massimiliano Caramia, Stefano Giordani:
A new approach for scheduling independent tasks with multiple modes. J. Heuristics 15(4): 313-329 (2009) - Marco Caserta, Marta Cabo Nodar:
A cross entropy based algorithm for reliability problems. J. Heuristics 15(5): 479-501 (2009) - Hamidreza Eskandari, Christopher D. Geiger:
Evolutionary multiobjective optimization in noisy problem environments. J. Heuristics 15(6): 559-595 (2009) - Matteo Fischetti, Ivan Luzzi:
Mixed-integer programming models for nesting problems. J. Heuristics 15(3): 201-226 (2009) - Salvador García, Daniel Molina, Manuel Lozano, Francisco Herrera:
A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization. J. Heuristics 15(6): 617-644 (2009) - Melissa D. Goodman, Kathryn A. Dowsland, Jonathan M. Thompson:
A grasp-knapsack hybrid for a nurse-scheduling problem. J. Heuristics 15(4): 351-379 (2009) - Simon Görtz, Andreas Klose:
Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem. J. Heuristics 15(4): 331-349 (2009) - Walter J. Gutjahr:
A provably convergent heuristic for stochastic bicriteria integer programming. J. Heuristics 15(3): 227-258 (2009) - Pierre Hansen, Vittorio Maniezzo, Stefan Voß:
Special issue on mathematical contributions to metaheuristics editorial. J. Heuristics 15(3): 197-199 (2009) - Alain Hertz, David Schindl, Nicolas Zufferey:
A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5): 425-450 (2009) - Christopher M. Homan, Lane A. Hemaspaandra:
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners. J. Heuristics 15(4): 403-423 (2009) - Lars Magnus Hvattum, Arne Løkketangen:
Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15(6): 527-557 (2009) - Yeong-Dae Kim, Byung-Jun Joo, Jong-Ho Shin:
Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint. J. Heuristics 15(1): 19-42 (2009) - Roxane Kouassi, Michel Gendreau, Jean-Yves Potvin, Patrick Soriano:
Heuristics for multi-period capacity expansion in local telecommunications networks. J. Heuristics 15(4): 381-402 (2009) - Enrico Malaguti, Michele Monaci, Paolo Toth:
Models and heuristic algorithms for a weighted vertex coloring problem. J. Heuristics 15(5): 503-526 (2009) - Alexandre Xavier Martins, Maurício C. de Souza, Marcone J. F. Souza, Túlio A. M. Toffolo:
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem. J. Heuristics 15(2): 133-151 (2009) - Andrés L. Medaglia, Juan G. Villegas, Diana M. Rodríguez-Coca:
Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network. J. Heuristics 15(2): 153-176 (2009) - Michael Racer, Robin Lovgren:
AEGIS - attribute experimentation guiding improvement searches. J. Heuristics 15(5): 451-478 (2009) - Roger Z. Ríos-Mercado:
Special issue of the Journal of Heuristics on "Heuristic Research: Advances and Applications". J. Heuristics 15(2): 105-107 (2009) - Jorge E. Rodríguez, Andrés L. Medaglia, Carlos A. Coello Coello:
Design of a motorcycle frame using neuroacceleration strategies in MOEAs. J. Heuristics 15(2): 177-196 (2009) - Renaud Sirdey, Jacques Carlier, Dritan Nace:
Approximate solution of a resource-constrained scheduling problem. J. Heuristics 15(1): 1-17 (2009) - Bart Wyns, Luc Boullart:
Efficient tree traversal to reduce code growth in tree-based genetic programming. J. Heuristics 15(1): 77-104 (2009)
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-06-05 04:16 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