Остановите войну!
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 82 matches
- 1991
- David L. Applegate, William J. Cook, S. Thomas McCormick:
Integral infeasibility and testing total dual integrality. Oper. Res. Lett. 10(1): 37-41 (1991) - Enrique Ballestero, Carlos Romero:
A theorem connecting utility function optimization and compromise programming. Oper. Res. Lett. 10(7): 421-427 (1991) - Harold P. Benson:
Complete efficiency and the initialization of algorithms for multiple objective programming. Oper. Res. Lett. 10(8): 481-487 (1991) - Harold P. Benson, Yasemin Aksoy:
Using efficient feasible directions in interactive multiple objective linear programming. Oper. Res. Lett. 10(4): 203-209 (1991) - Rainer E. Burkard, Franz Rendl:
Lexicographic bottleneck problems. Oper. Res. Lett. 10(5): 303-308 (1991) - James V. Burke, Michael C. Ferris:
Characterization of solution sets of convex programs. Oper. Res. Lett. 10(1): 57-60 (1991) - Katarína Cechlárová:
The uniquely solvable bipartite matching problem. Oper. Res. Lett. 10(4): 221-224 (1991) - Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard:
On-line and off-line vertex enumeration by adjacency lists. Oper. Res. Lett. 10(7): 403-409 (1991) - Jhitti Chiarawongse, Mandyam M. Srinivasan:
On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals. Oper. Res. Lett. 10(8): 453-459 (1991) - Thomas Christof, Michael Jünger, Gerhard Reinelt:
A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. 10(9): 497-500 (1991) - Nam-kee Chung, Dong-wan Tcha:
A dual algorithm for submodular flow problems. Oper. Res. Lett. 10(8): 489-495 (1991) - Yves Dallery, Don Towsley:
Symmetry property of the throughput in closed tandem queueing networks with finite buffers. Oper. Res. Lett. 10(9): 541-547 (1991) - Martin Desrochers, Gilbert Laporte:
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Oper. Res. Lett. 10(1): 27-36 (1991) - Nico M. van Dijk:
'Stop = recirculate' for exponential product form queueing networks with departure blocking. Oper. Res. Lett. 10(6): 343-351 (1991) - Bharat Doshi:
Analysis of a two phase queueing system with general service times. Oper. Res. Lett. 10(5): 265-272 (1991) - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing the number of late jobs on unrelated machines. Oper. Res. Lett. 10(3): 153-158 (1991) - Krzysztof Dudzinski:
A note on dominance relation in unbounded knapsack problems. Oper. Res. Lett. 10(7): 417-419 (1991) - C. W. Duin, A. Volgenant:
Minimum deviation and balanced optimization: A unified approach. Oper. Res. Lett. 10(1): 43-48 (1991) - Yahya Fathi:
SQVAM: A variance minimizing algorithm. Oper. Res. Lett. 10(8): 461-466 (1991) - David Fernández-Baca, S. Srinivasan:
Constructing the minimization diagram of a two-parameter problem. Oper. Res. Lett. 10(2): 87-93 (1991) - Bennett L. Fox, David Goldsman, James J. Swain:
Spaced batch means. Oper. Res. Lett. 10(5): 255-263 (1991) - Esther Frostig:
On the optimality of static policy in stochastic open shop. Oper. Res. Lett. 10(9): 509-512 (1991) - Ubaldo M. García-Palomares, William Colmenares:
On the minimization of a quasi-concave function subject to linear constraints. Oper. Res. Lett. 10(3): 137-141 (1991) - A. M. H. Gerards:
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus. Oper. Res. Lett. 10(7): 377-382 (1991) - José Claudio Geromel, Paulo Augusto Valente Ferreira:
An upper bound on properly efficient solutions in multiobjective optimization. Oper. Res. Lett. 10(2): 83-86 (1991) - Peter W. Glynn, Philip Heidelberger:
Analysis of initial transient deletion for replicated steady-state simulations. Oper. Res. Lett. 10(8): 437-443 (1991) - Peter W. Glynn, Ward Whitt:
Estimating the asymptotic variance with batch means. Oper. Res. Lett. 10(8): 431-435 (1991) - Michel X. Goemans, Kalyan T. Talluri:
2-Change for k-connected networks. Oper. Res. Lett. 10(2): 113-117 (1991) - Donald Goldfarb, Jianxiu Hao:
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10(7): 383-387 (1991) - Nicholas G. Hall, Wieslaw Kubiak:
Proof of a conjecture of Schrage about the completion time variance problem. Oper. Res. Lett. 10(8): 467-472 (1991)
skipping 52 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-05-15 02:07 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