Остановите войну!
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 28 matches
- 1994
- Alexandre A. Andreatta, Celso C. Ribeiro:
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits. Ann. Oper. Res. 50(1): 1-36 (1994) - Luis Contesse B:
A general algorithm for determining all essential solutions and inequalities for any convex polyhedron. Ann. Oper. Res. 50(1): 187-218 (1994) - E. Andrew Boyd:
Solving 0/1 integer programs with enumeration cutting planes. Ann. Oper. Res. 50(1): 61-72 (1994) - Peter Brucker, Bernd Jurisch, Andreas Krämer:
The job-shop problem and immediate selection. Ann. Oper. Res. 50(1): 73-114 (1994) - Wen-Chyuan Chiang, Panagiotis Kouvelis:
Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems. Ann. Oper. Res. 50(1): 115-142 (1994) - Sunil Chopra:
Comparison of formulations and a heuristic for packing Steiner trees in a graph. Ann. Oper. Res. 50(1): 143-171 (1994) - Charles J. Colbourn, Louis D. Nel, T. Brian Boffey, Derek F. Yates:
Network reliability and the probabilistic estimation of damage from fire spread. Ann. Oper. Res. 50(1): 173-185 (1994) - Laureano F. Escudero, Monique Guignard, Kavindra Malik:
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. Ann. Oper. Res. 50(1): 219-237 (1994) - J. R. Araque G, Gautham K. Kudva, Thomas L. Morin, Joseph F. Pekny:
A branch-and-cut algorithm for vehicle routing problems. Ann. Oper. Res. 50(1): 37-59 (1994) - Wenxue Han, Pierre Dejax:
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. Ann. Oper. Res. 50(1): 263-279 (1994) - Bernard T. Han, George Diehr, Jack S. Cook:
Multiple-type, two-dimensional bin packing problems: Applications and algorithms. Ann. Oper. Res. 50(1): 239-261 (1994) - Samuel Jurkiewicz:
Planar graphs, Hamilton cycles and extreme independence number. Ann. Oper. Res. 50(1): 281-293 (1994) - Selçuk Karabati, Panagiotis Kouvelis:
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines. Ann. Oper. Res. 50(1): 295-317 (1994) - Panagiotis Kouvelis, Gang Yu, Songjun Luo:
Vertex packing problem application to the design of electronic testing fixtures. Ann. Oper. Res. 50(1): 319-337 (1994) - Youngho Lee, Hanif D. Sherali:
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem. Ann. Oper. Res. 50(1): 339-365 (1994) - Cristina M. A. Leopoldino, Mario V. F. Pereira, Leontina M. V. Pinto, Celso C. Ribeiro:
A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning. Ann. Oper. Res. 50(1): 367-385 (1994) - Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende:
Lower bounds for the quadratic assignment problem. Ann. Oper. Res. 50(1): 387-410 (1994) - Francisco Menezes, Pedro Barahona:
Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently. Ann. Oper. Res. 50(1): 411-426 (1994) - Philippe Michelon, Marcelo Dib Cruz, Viviane Gascon:
Using the tabu search method for the distribution of supplies in a hospital. Ann. Oper. Res. 50(1): 427-435 (1994) - Leone C. Monticone, George Funk:
Application of the facility location problem to the problem of locating concentrators on an FAA microwave system. Ann. Oper. Res. 50(1): 437-454 (1994) - Robert M. Nauss:
Optimizing single-terminal dispatch of large volume trips to trucks. Ann. Oper. Res. 50(1): 455-471 (1994) - Nelio Domingues Pizzolato:
A heuristic for large-sizep-median location problems with application to school location. Ann. Oper. Res. 50(1): 473-485 (1994) - Michael Racer, Mohammad M. Amini:
A robust heuristic for the Generalized Assignment Problem. Ann. Oper. Res. 50(1): 487-503 (1994) - Harold K. Rappoport, Laurence S. Levy, Katherine J. Toussaint, Bruce L. Golden:
A transportation problem formulation for the MAC Airlift Planning problem. Ann. Oper. Res. 50(1): 505-523 (1994) - Celso C. Ribeiro, Nelson Maculan:
Foreword. Ann. Oper. Res. 50(1) (1994) - William T. Scherer, Frank Rotman:
Combinatorial optimization techniques for spacecraft scheduling automation. Ann. Oper. Res. 50(1): 525-556 (1994) - Kleber X. X. De Souza, Vinícius Amaral Armentano:
Multi-item capacitated lot-sizing by a Cross decomposition based algorithm. Ann. Oper. Res. 50(1): 557-574 (1994) - Daniel Tuyttens, Marc Pirlot, Jacques Teghem, E. Trauwaert, B. Liégeois:
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Ann. Oper. Res. 50(1): 575-607 (1994)
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-04-23 15:04 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