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 44 matches
- 1993
- Marc Abrams:
Commentary - Parallel Discrete Event Simulation: Fact or Fiction? INFORMS J. Comput. 5(3): 231-233 (1993) - Mohammad M. Amini, Richard S. Barr:
Network Reoptimization Algorithms: A Statistically Designed Comparison. INFORMS J. Comput. 5(4): 395-409 (1993) - Rajive L. Bagrodia:
Commentary - A Survival Guide for Parallel Simulation. INFORMS J. Comput. 5(3): 234-235 (1993) - Richard S. Barr, Betty L. Hickman:
Feature Article - Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions. INFORMS J. Comput. 5(1): 2-18 (1993) - Richard S. Barr, Betty L. Hickman:
Rejoinder - Using Parallel Empirical Testing to Advance Algorithm Research. INFORMS J. Comput. 5(1): 29-32 (1993) - Dimitri P. Bertsekas, David A. Castañón:
Parallel Asynchronous Hungarian Methods for the Assignment Problem. INFORMS J. Comput. 5(3): 261-274 (1993) - Hemant K. Bhargava:
Dimensional Analysis in Mathematical Modeling Systems: A Simple Numerical Method. INFORMS J. Comput. 5(1): 33-39 (1993) - Karl Heinz Borgwardt, Renate Damm, Rudolf Donig, Gabriele Joas:
Empirical Studies on the Average Efficiency of Simplex Variants under Rotation Symmetry. INFORMS J. Comput. 5(3): 249-260 (1993) - Tamra J. Carpenter, Irvin J. Lustig, John M. Mulvey, David F. Shanno:
Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure. INFORMS J. Comput. 5(2): 182-191 (1993) - Bo Chen, Vitaly A. Strusevich:
Approximation Algorithms for Three-Machine Open Shop Scheduling. INFORMS J. Comput. 5(3): 321-326 (1993) - William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross:
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming. INFORMS J. Comput. 5(2): 206-212 (1993) - Jonathan Eckstein:
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2. INFORMS J. Comput. 5(1): 84-96 (1993) - Matteo Fischetti, Paolo Toth:
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs. INFORMS J. Comput. 5(4): 426-434 (1993) - Bennett L. Fox:
Shortening Future-Event Lists. INFORMS J. Comput. 5(2): 147-150 (1993) - Richard M. Fujimoto:
Feature Article - Parallel Discrete Event Simulation: Will the Field Survive? INFORMS J. Comput. 5(3): 213-230 (1993) - Richard M. Fujimoto:
Rejoinder - Future Directions in Parallel Simulation Research. INFORMS J. Comput. 5(3): 245-248 (1993) - Giorgio Gallo, Maria Grazia Scutellà:
Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations. INFORMS J. Comput. 5(2): 120-133 (1993) - Shahram Ghandeharizadeh, Robert R. Meyer, Gary L. Schultz, Jonathan Yackel:
Optimal Balanced Assignments and a Parallel Database Application. INFORMS J. Comput. 5(2): 151-167 (1993) - Bruce L. Golden:
From the Editor. INFORMS J. Comput. 5(1): 1 (1993) - Bruce L. Golden:
From the Editor. INFORMS J. Comput. 5(4): 327 (1993) - Winfried K. Grassmann, Daniel P. Heyman:
Computation of Steady-State Probabilities for Infinite-State Markov Chains with Repeating Rows. INFORMS J. Comput. 5(3): 292-303 (1993) - John L. Gustafson:
Commentary - The "Tar Baby" of Computing: Performance Analysis. INFORMS J. Comput. 5(1): 19-21 (1993) - Pierre Hansen, Brigitte Jaumard, Vincent Mathon:
State-of-the-Art Survey - Constrained Nonlinear 0-1 Programming. INFORMS J. Comput. 5(2): 97-119 (1993) - Mary A. Johnson:
Selecting Parameters of Phase Distributions: Combining Nonlinear Programming, Heuristics, and Erlang Distributions. INFORMS J. Comput. 5(1): 69-83 (1993) - Surya Danusaputro Liman, Chung-Yee Lee:
Error Bound of a Heuristic for the Common Due Date Scheduling Problem. INFORMS J. Comput. 5(4): 420-425 (1993) - Yi-Bing Lin:
Commentary - Will Parallel Simulation Research Survive? INFORMS J. Comput. 5(3): 236-238 (1993) - David Loshin, Alex Vasilevsky:
Commentary - Parallel Reporting Guidelines Are on Target. INFORMS J. Comput. 5(1): 22-23 (1993) - Ewing L. Lusk:
Commentary - Speedups and Insights. INFORMS J. Comput. 5(1): 24-25 (1993) - O. L. Mangasarian:
Mathematical Programming in Neural Networks. INFORMS J. Comput. 5(4): 349-360 (1993) - Donald L. Miller, Joseph F. Pekny:
Commentary - The Role of Performance Metrics for Parallel Mathematical Programming Algorithms. INFORMS J. Comput. 5(1): 26-28 (1993)
skipping 14 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-12-23 03:45 CET 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