Остановите войну!
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 29 matches
- 2001
- Djangir A. Babayev, George I. Bell:
An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint. J. Heuristics 7(2): 169-184 (2001) - Erick Cantú-Paz:
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms. J. Heuristics 7(4): 311-334 (2001) - Roberto Cordone, Roberto Wolfler Calvo:
A Heuristic for the Vehicle Routing Problem with Time Windows. J. Heuristics 7(2): 107-129 (2001) - Steven P. Coy, Bruce L. Golden, George C. Runger, Edward A. Wasil:
Using Experimental Design to Find Effective Parameter Settings for Heuristics. J. Heuristics 7(1): 77-97 (2001) - Gail W. DePuy, Martin W. P. Savelsbergh, Jane C. Ammons, Leon F. McGinnis:
An Integer Programming Heuristic for Component Allocation in Printed Circuit Card Assembly Systems. J. Heuristics 7(4): 351-369 (2001) - Jacques A. Ferland, Ilham Berrada, Imene Nabli, B. Ahiod, Philippe Michelon, Viviane Gascon, Éric Gagné:
Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling. J. Heuristics 7(4): 391-413 (2001) - Alan P. French, Andrew C. Robinson, John M. Wilson:
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems. J. Heuristics 7(6): 551-564 (2001) - Peter Greistorfer, Hans Kellerer:
Bounds and Tabu Search for a Cyclic Max-Min Scheduling Problem. J. Heuristics 7(4): 371-390 (2001) - T. Aaron Gulliver, Patric R. J. Östergård:
Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search. J. Heuristics 7(1): 37-46 (2001) - Peter L. Hammer, David J. Rader Jr.:
Maximally Disjoint Solutions of the Set Covering Problem. J. Heuristics 7(2): 131-144 (2001) - Saïd Hanafi:
On the Convergence of Tabu Search. J. Heuristics 7(1): 47-58 (2001) - Pierre Hansen, Nenad Mladenovic, Dionisio Pérez-Brito:
Variable Neighborhood Decomposition Search. J. Heuristics 7(4): 335-350 (2001) - Richard V. Helgason, Jeffery L. Kennington, Karen R. Lewis:
Cruise Missile Mission Planning: A Heuristic Algorithm for Automatic Path Generation. J. Heuristics 7(5): 473-494 (2001) - Nesa Ilich, Slobodan P. Simonovic:
An Evolution Program for Non-Linear Transportation Problems. J. Heuristics 7(2): 145-168 (2001) - Tibor Illés, David Pisinger:
Upper Bounds on the Covering Number of Galois-Planes with Small Order. J. Heuristics 7(1): 59-76 (2001) - Arun Jagota, Laura A. Sanchis:
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique. J. Heuristics 7(6): 565-585 (2001) - Márk Jelasity, Pilar Martínez Ortigosa, Inmaculada García:
UEGO, an Abstract Clustering Technique for Multimodal Global Optimization. J. Heuristics 7(3): 215-233 (2001) - Mohan Krishnamoorthy, Andreas T. Ernst, Yazid M. Sharaiha:
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree. J. Heuristics 7(6): 587-611 (2001) - Ronald L. Rardin, Reha Uzsoy:
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial. J. Heuristics 7(3): 261-304 (2001) - Youssef Saab:
A Fast and Effective Algorithm for the Feedback Arc Set Problem. J. Heuristics 7(3): 235-250 (2001) - Hussain Aziz Saleh, Peter Dare:
Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques. J. Heuristics 7(6): 533-549 (2001) - Rahul Simha, Weidong Cai, Valentin I. Spitkovsky:
Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem. J. Heuristics 7(1): 23-36 (2001) - Francis Sourd:
Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures. J. Heuristics 7(6): 519-531 (2001) - Christine L. Valenzuela:
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation. J. Heuristics 7(1): 5-21 (2001) - Michel Vasquez, Jin-Kao Hao:
A Heuristic Approach for Antenna Positioning in Cellular Networks. J. Heuristics 7(5): 443-472 (2001) - Mike Wright:
Subcost-Guided Search-Experiments with Timetabling Problems. J. Heuristics 7(3): 251-260 (2001) - Jiyang Xu, Steve Y. Chiu:
Effective Heuristic Procedures for a Field Technician Scheduling Problem. J. Heuristics 7(5): 495-509 (2001) - Mutsunori Yagiura, Toshihide Ibaraki:
Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT: Experimental Evaluation. J. Heuristics 7(5): 423-442 (2001) - Rachel Q. Zhang, Wallace J. Hopp, Chonawee Supatgiat:
Spreadsheet Implementable Inventory Control for a Distribution Center. J. Heuristics 7(2): 185-203 (2001)
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-05-29 03:48 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