Остановите войну!
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
- 2001
- Christos Alexopoulos, David Goldsman, Gamze Tokol:
Properties of Batched Quadratic-Form Variance Parameter Estimators for Simulations. INFORMS J. Comput. 13(2): 149-156 (2001) - Egon Balas, Neil Simonetti:
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. INFORMS J. Comput. 13(1): 56-75 (2001) - Michael O. Ball, Andrew Vakhutinsky:
Fault-Tolerant Virtual Path Layout in ATM Networks. INFORMS J. Comput. 13(1): 76-94 (2001) - Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie:
The Online TSP Against Fair Adversaries. INFORMS J. Comput. 13(2): 138-148 (2001) - Alberto Caprara, Giuseppe Lancia, See-Kiong Ng:
Sorting Permutations by Reversals Through Branch-and-Price. INFORMS J. Comput. 13(3): 224-244 (2001) - Steven Chamberland, Brunilde Sansò:
On the Design Problem of Multitechnology Networks. INFORMS J. Comput. 13(3): 245-256 (2001) - Mohan L. Chaudhry, Umesh Chandra Gupta, Veena Goswami:
Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m. INFORMS J. Comput. 13(3): 172-180 (2001) - Huifen Chen:
Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations. INFORMS J. Comput. 13(4): 312-331 (2001) - John W. Chinneck:
Fast Heuristics for the Maximum Feasible Subsystem Problem. INFORMS J. Comput. 13(3): 210-223 (2001) - Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS J. Comput. 13(2): 120-137 (2001) - Ram D. Gopal, Ram Ramesh, Stanley Zionts:
Cascade Graphs: Design, Analysis and Algorithms for Relational Joins. INFORMS J. Comput. 13(1): 2-28 (2001) - Constantine N. Goulimis:
Technical Note on "Optimal Integer Solutions to Industrial Cutting Stock Problems" by Degraeve and Schrage. INFORMS J. Comput. 13(4): 360- (2001) - Dorit S. Hochbaum, Eli V. Olinick:
The Bounded Cycle-Cover Problem. INFORMS J. Comput. 13(2): 104-119 (2001) - Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13(2): 157-168 (2001) - Vipul Jain, Ignacio E. Grossmann:
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems. INFORMS J. Comput. 13(4): 258-276 (2001) - W. David Kelton:
From the Editor. INFORMS J. Comput. 13(1): 1 (2001) - W. David Kelton:
From the Editor. INFORMS J. Comput. 13(3): 171 (2001) - W. David Kelton:
From the Editor. INFORMS J. Comput. 13(4): 257- (2001) - Jeffery L. Kennington, Mark W. Lewis:
The Path Restoration Version of the Spare Capacity Allocation Problem with Modularity Restrictions: Models, Algorithms, and an Empirical Analysis. INFORMS J. Comput. 13(3): 181-190 (2001) - Xiao-Bai Li, James R. Sweigart, James T. C. Teng, Joan M. Donohue, Lori A. Thombs:
A Dynamic Programming Based Pruning Method for Decision Trees. INFORMS J. Comput. 13(4): 332-344 (2001) - Jeff T. Linderoth, Eva K. Lee, Martin W. P. Savelsbergh:
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems. INFORMS J. Comput. 13(3): 191-209 (2001) - Csaba Mészáros, Jacek Gondzio:
Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method". INFORMS J. Comput. 13(2): 169-170 (2001) - Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer, Christian Kanzow:
The Semismooth Algorithm for Large Scale Complementarity Problems. INFORMS J. Comput. 13(4): 294-311 (2001) - Joel A. Shapiro, Warren B. Powell, David Bernstein:
A Flexible Java Representation for Uncertainty in Online Operations-Research Models. INFORMS J. Comput. 13(1): 29-55 (2001) - Natalie M. Steiger, James R. Wilson:
Convergence Properties of the Batch Means Method for Simulation Output Analysis. INFORMS J. Comput. 13(4): 277-293 (2001) - Felisa J. Vázquez-Abad, Sheldon H. Jacobson:
Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems. INFORMS J. Comput. 13(4): 345-359 (2001) - H. Paul Williams, Hong Yan:
Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming. INFORMS J. Comput. 13(2): 96-103 (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-06-14 10:33 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