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 43 matches
- 2006
- Joseph Abate, Ward Whitt:
A Unified Framework for Numerically Inverting Laplace Transforms. INFORMS J. Comput. 18(4): 408-421 (2006) - Anurag Agarwal, Varghese S. Jacob, Hasan Pirkul:
An Improved Augmented Neural-Network Approach for Scheduling Problems. INFORMS J. Comput. 18(1): 119-128 (2006) - Shirook M. Ali, Natalia K. Nikolova, Mohamed H. Bakr:
A Discrete Adjoint Variable Method for Printed-Circuit Board Computer-Aided Design. INFORMS J. Comput. 18(2): 186-196 (2006) - Miguel F. Anjos, Anthony Vannelli:
A New Mathematical-Programming Framework for Facility-Layout Design. INFORMS J. Comput. 18(1): 111-118 (2006) - Laleh Behjat, Anthony Vannelli, William D. Rosehart:
Integer Linear Programming Models for Global Routing. INFORMS J. Comput. 18(2): 137-150 (2006) - Hemant K. Bhargava, Daewon Sun, Susan H. Xu:
Stockout Compensation: Joint Inventory and Price Optimization in Electronic Retailing. INFORMS J. Comput. 18(2): 255-266 (2006) - Ramesh Bollapragada, Yanjun Li, Uday S. Rao:
Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks. INFORMS J. Comput. 18(4): 422-432 (2006) - Seok Ho Chang, Dae Won Choi:
Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The MX/GY/1/K + B Queue with Setup Times. INFORMS J. Comput. 18(2): 218-228 (2006) - Elaine Chew:
Slicing It All Ways: Mathematical Models for Tonal Induction, Approximation, and Segmentation Using the Spiral Array. INFORMS J. Comput. 18(3): 305-320 (2006) - John W. Chinneck:
From the Guest Editor - Special Cluster on Operations Research in Electrical and Computer Engineering. INFORMS J. Comput. 18(2): 135-136 (2006) - Darrell Conklin, Christina Anagnostopoulou:
Segmental Pattern Discovery in Music. INFORMS J. Comput. 18(3): 285-293 (2006) - Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
A Memetic Heuristic for the Generalized Quadratic Assignment Problem. INFORMS J. Comput. 18(4): 433-443 (2006) - Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li:
Early Estimates of the Size of Branch-and-Bound Trees. INFORMS J. Comput. 18(1): 86-96 (2006) - Debabrata Dey, Zhongju Zhang, Prabuddha De:
Optimal Synchronization Policies for Data Warehouses. INFORMS J. Comput. 18(2): 229-242 (2006) - José H. Dulá, Francisco J. López:
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron. INFORMS J. Comput. 18(1): 97-110 (2006) - Kaushik Dutta, Samit Soni, Sridhar Narasimhan, Anindya Datta:
Optimization in Object Caching. INFORMS J. Comput. 18(2): 243-254 (2006) - Diane L. Evans, Lawrence M. Leemis, John H. Drew:
The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping. INFORMS J. Comput. 18(1): 19-30 (2006) - Xiao Fang, Olivia R. Liu Sheng, Wei Gao, Balakrishna R. Iyer:
A Data-Mining-Based Prefetching Approach to Caching for Network Storage Systems. INFORMS J. Comput. 18(2): 267-282 (2006) - John J. H. Forrest, Jayant Kalagnanam, Laszlo Ladányi:
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints. INFORMS J. Comput. 18(1): 129-134 (2006) - Antonio Frangioni, Antonio Manca:
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems. INFORMS J. Comput. 18(1): 61-70 (2006) - Judy A. Franklin:
Recurrent Neural Networks for Music Computation. INFORMS J. Comput. 18(3): 321-338 (2006) - Ioannis Gamvros, Bruce L. Golden, S. Raghavan:
The Multilevel Capacitated Minimum Spanning Tree Problem. INFORMS J. Comput. 18(3): 348-365 (2006) - Emilia Gómez:
Tonal Description of Polyphonic Audio for Music Content Processing. INFORMS J. Comput. 18(3): 294-304 (2006) - Xiaoming Huo, Seoung Bum Kim, Kwok-Leung Tsui, Shuchun Wang:
FBP: A Frontier-Based Tree-Pruning Algorithm. INFORMS J. Comput. 18(4): 494-505 (2006) - Stefan Irnich, Daniel Villeneuve:
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3. INFORMS J. Comput. 18(3): 391-406 (2006) - Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
Base Station Location and Service Assignments in W - CDMA Networks. INFORMS J. Comput. 18(3): 366-376 (2006) - W. David Kelton:
From the Editor. INFORMS J. Comput. 18(4): 407 (2006) - Dorothy Kucar, Anthony Vannelli:
Using Eigenvectors to Partition Circuits. INFORMS J. Comput. 18(2): 197-208 (2006) - Michael E. Kuhl, Sachin G. Sumant, James R. Wilson:
An Automated Multiresolution Procedure for Modeling Complex Arrival Processes. INFORMS J. Comput. 18(1): 3-18 (2006) - Andrea Lodi, Michela Milano, Louis-Martin Rousseau:
Discrepancy-Based Additive Bounding Procedures. INFORMS J. Comput. 18(4): 480-493 (2006)
skipping 13 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-11-21 22:02 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