Остановите войну!
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 34 matches
- 1999
- David Abramson, Marcus Randall:
A simulated annealing code for general integer linear programs. Ann. Oper. Res. 86: 3-21 (1999) - Khaled S. Al-Sultan, Mohammad Abdulrahman Al-Fawzan:
A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86: 91-103 (1999) - Shara Amin:
Simulated Jumping. Ann. Oper. Res. 86: 23-38 (1999) - Shoshana Anily, Celia A. Glass, Refael Hassin:
Scheduling maintenance services to three machines. Ann. Oper. Res. 86: 375-391 (1999) - Pasquale Avella, Antonio Sforza:
Logical reduction tests for the p-problem. Ann. Oper. Res. 86: 105-115 (1999) - Egon Balas:
New classes of efficiently solvable generalized Traveling Salesman Problems. Ann. Oper. Res. 86: 529-558 (1999) - Chuda B. Basnet, Les R. Foulds, John M. Wilson:
An exact algorithm for a milk tanker scheduling and sequencing problem. Ann. Oper. Res. 86: 559-568 (1999) - Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
Minimizing total completion time subject to release dates and sequence-dependentprocessing times. Ann. Oper. Res. 86: 393-415 (1999) - Michael J. Brusco, Larry W. Jacobs, Gary M. Thompson:
A morphing procedure to supplement a simulated annealing heuristic for cost- andcoverage-correlated set-covering problems. Ann. Oper. Res. 86: 611-627 (1999) - C. J. Burgess, Alain G. Chalmers:
Optimisation of irregular multiprocessor computer architectures using geneticalgorithms. Ann. Oper. Res. 86: 239-257 (1999) - José M. Valério de Carvalho:
Exact solution of bin-packing problems using column generation and branch-and-bound. Ann. Oper. Res. 86: 629-659 (1999) - D. Castelino, N. M. Stephens:
A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem. Ann. Oper. Res. 86: 259-270 (1999) - Pierre Chardaire, J.-L. Lutton, Alain Sutter:
Upper and lower bounds for the two-level simple plant location problem. Ann. Oper. Res. 86: 117-140 (1999) - Inna G. Drobouchevitch, Vitaly A. Strusevich:
A heuristic algorithm for two-machine re-entrant shop scheduling. Ann. Oper. Res. 86: 417-439 (1999) - Andreas T. Ernst, Mohan Krishnamoorthy:
Solution algorithms for the capacitated single allocation hub location problem. Ann. Oper. Res. 86: 141-159 (1999) - Luis Eduardo Neves Gouveia, Pedro Martins:
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel. Ann. Oper. Res. 86: 271-294 (1999) - M. T. Hajian, R. Rodosek, B. Richards:
Introduction of a new class of variables to discrete and integer programmingproblems. Ann. Oper. Res. 86: 39-51 (1999) - S. A. Harrison, Victor J. Rayward-Smith:
Minimal cost linkages in graphs. Ann. Oper. Res. 86: 295-319 (1999) - Curt Hjorring, John Holt:
New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86: 569-584 (1999) - Cory J. Hoelting, Dale A. Schoenefeld, Roger L. Wainwright:
Analysis of fault location in a network. Ann. Oper. Res. 86: 161-177 (1999) - Marek Libura:
On accuracy of solutions for discrete optimization problems with perturbed coefficientsof the objective function. Ann. Oper. Res. 86: 53-62 (1999) - Alfredo Marín, Blas Pelegrín:
Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86: 179-198 (1999) - Geraldo Robson Mateus, Jean-Michel Thizy:
Exact sequential choice of locations in a network. Ann. Oper. Res. 86: 199-219 (1999) - Dirk C. Mattfeld, Christian Bierwirth, Herbert Kopfer:
A search space analysis of the Job Shop Scheduling Problem. Ann. Oper. Res. 86: 441-453 (1999) - Aziz Moukrim:
On the minimum number of processors for scheduling problems with communicationdelays. Ann. Oper. Res. 86: 455-472 (1999) - Rosa Maria Ramos, María Teresa Ramos, Marcos Colebrook, Joaquín Sicilia:
Locating a facility on a network with multiple median-type objectives. Ann. Oper. Res. 86: 221-235 (1999) - C. R. Reeves:
Landscapes, operators and heuristic search. Ann. Oper. Res. 86: 473-490 (1999) - R. Rodosek, Mark G. Wallace, M. T. Hajian:
A new approach to integrating mixed integer programming and constraint logicprogramming. Ann. Oper. Res. 86: 63-87 (1999) - Jürgen Schulze, Torsten Fahle:
A parallel algorithm for the vehicle routing problem with time window constraints. Ann. Oper. Res. 86: 585-607 (1999) - Yazid M. Sharaiha, John E. Beasley:
Foreword. Ann. Oper. Res. 86: 0 (1999)
skipping 4 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-09-05 03:18 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