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 35 matches
- 1999
- Joseph Abate, Ward Whitt:
Computing Laplace Transforms for Numerical Inversion Via Continued Fractions. INFORMS J. Comput. 11(4): 394-405 (1999) - Erling D. Andersen:
On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming. INFORMS J. Comput. 11(1): 95-103 (1999) - Igor Averbakh, Oded Berman:
Parallel Complexity of Additive Location Problems. INFORMS J. Comput. 11(3): 292-298 (1999) - Hemant K. Bhargava:
Data Mining by Decomposition: Adaptive Search for Hypothesis Generation. INFORMS J. Comput. 11(3): 239-247 (1999) - Siddhartha Bhattacharyya:
Direct Marketing Performance Modeling Using Genetic Algorithms. INFORMS J. Comput. 11(3): 248-257 (1999) - Paul S. Bradley, Usama M. Fayyad, Olvi L. Mangasarian:
Mathematical Programming for Data Mining: Formulations and Challenges. INFORMS J. Comput. 11(3): 217-238 (1999) - Alberto Caprara, David Pisinger, Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem. INFORMS J. Comput. 11(2): 125-137 (1999) - Zhi-Long Chen, Warren B. Powell:
Solving Parallel Machine Scheduling Problems by Column Generation. INFORMS J. Comput. 11(1): 78-94 (1999) - William J. Cook, André Rohe:
Computing Minimum-Weight Perfect Matchings. INFORMS J. Comput. 11(2): 138-148 (1999) - Gérard Cornuéjols, Milind Dawande:
A Class of Hard Small 0-1 Programs. INFORMS J. Comput. 11(2): 205-210 (1999) - Zeger Degraeve, Linus Schrage:
Optimal Integer Solutions to Industrial Cutting Stock Problems. INFORMS J. Comput. 11(4): 406-419 (1999) - Mark A. Fleischer, Sheldon H. Jacobson:
Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results. INFORMS J. Comput. 11(1): 35-43 (1999) - Charles Fleurent, Fred W. Glover:
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory. INFORMS J. Comput. 11(2): 198-204 (1999) - Antonio Frangioni, Giorgio Gallo:
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems. INFORMS J. Comput. 11(4): 370-393 (1999) - Harvey J. Greenberg:
Matrix Sensitivity Analysis from an Interior Solution of a Linear Program. INFORMS J. Comput. 11(3): 316-327 (1999) - Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. INFORMS J. Comput. 11(1): 117-123 (1999) - Olivier Guieu, John W. Chinneck:
Analyzing Infeasible Mixed-Integer and Integer Linear Programs. INFORMS J. Comput. 11(1): 63-77 (1999) - Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo:
Improvement Procedures for the Undirected Rural Postman Problem. INFORMS J. Comput. 11(1): 53-62 (1999) - James P. Kelly, Jiefeng Xu:
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem. INFORMS J. Comput. 11(2): 161-172 (1999) - Jeffery L. Kennington, Jason E. Whitler:
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network. INFORMS J. Comput. 11(2): 149-160 (1999) - Prabhudev Konana, Sudha Ram:
Semantics-Based Transaction Processing for Real-Time Databases: The Case of Automated Stock Trading. INFORMS J. Comput. 11(3): 299-315 (1999) - Akhil Kumar, Ignacio Olmeda:
A Study of Composite or Hybrid Classifiers for Knowledge Discovery. INFORMS J. Comput. 11(3): 267-277 (1999) - Manuel Laguna, Rafael Martí:
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. INFORMS J. Comput. 11(1): 44-52 (1999) - Larry J. LeBlanc, Jerome Chifflet, Philippe Mahey:
Packet Routing in Telecommunication Networks with Path and Flow Restrictions. INFORMS J. Comput. 11(2): 188-197 (1999) - Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Computational Study of Search Strategies for Mixed Integer Programming. INFORMS J. Comput. 11(2): 173-187 (1999) - Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. INFORMS J. Comput. 11(4): 345-357 (1999) - Vittorio Maniezzo:
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. INFORMS J. Comput. 11(4): 358-369 (1999) - Michael V. Mannino, Vijay S. Mookerjee:
Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies. INFORMS J. Comput. 11(3): 278-291 (1999) - Laurent D. Michel, Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search. INFORMS J. Comput. 11(1): 1-14 (1999) - Selwyn Piramuthu:
Feature Selection for Financial Credit-Risk Evaluation Decisions. INFORMS J. Comput. 11(3): 258-266 (1999)
skipping 5 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-10-15 10:55 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