Остановите войну!
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 47 matches
- 2012
- Daniel Adelman, Diego Klabjan:
Computing Near-Optimal Policies in Generalized Joint Replenishment. INFORMS J. Comput. 24(1): 148-164 (2012) - Sam D. Allen, Edmund K. Burke:
Data Structures for Higher-Dimensional Rectilinear Packing. INFORMS J. Comput. 24(3): 457-470 (2012) - Ebru Angün, Jack P. C. Kleijnen:
An Asymptotic Test of Optimality Conditions in Multiresponse Simulation Optimization. INFORMS J. Comput. 24(1): 53-65 (2012) - Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza:
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable. INFORMS J. Comput. 24(1): 165-171 (2012) - Xue Bai:
A Mathematical Framework for Data Quality Management in Enterprise Systems. INFORMS J. Comput. 24(4): 648-664 (2012) - Xue Bai, Ram D. Gopal, Manuel A. Nunez, Dmitry Zhdanov:
On the Prevention of Fraud and Privacy Exposure in Process Information Flow. INFORMS J. Comput. 24(3): 416-432 (2012) - Roberto Baldacci, Aristide Mingozzi, Roberto Roberti:
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(3): 356-371 (2012) - Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte:
A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS J. Comput. 24(3): 343-355 (2012) - John Gunnar Carlsson:
Dividing a Territory Among Several Vehicles. INFORMS J. Comput. 24(4): 565-577 (2012) - Daniele Catanzaro, Martine Labbé, Raffaele Pesenti, Juan José Salazar González:
The Balanced Minimum Evolution Problem. INFORMS J. Comput. 24(2): 276-294 (2012) - John W. Chinneck:
From the Editor. INFORMS J. Comput. 24(4): 517 (2012) - Sanjeeb Dash, Oktay Günlük, Andrea Lodi, Andrea Tramontani:
A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(1): 132-147 (2012) - Milind Dawande, Vijay S. Mookerjee, Chelliah Sriskandarajah, Yunxia Zhu:
Structural Search and Optimization in Social Networks. INFORMS J. Comput. 24(4): 611-623 (2012) - Daniel Delling, Giacomo Nannicini:
Core Routing on Dynamic Time-Dependent Road Networks. INFORMS J. Comput. 24(2): 187-201 (2012) - Gabriella Dellino, Jack P. C. Kleijnen, Carlo Meloni:
Robust Optimization in Simulation: Taguchi and Krige Combined. INFORMS J. Comput. 24(3): 471-484 (2012) - Mehmet C. Demirci, Andrew J. Schaefer, H. Edwin Romeijn, Mark S. Roberts:
An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy. INFORMS J. Comput. 24(2): 260-275 (2012) - Lih-Yuan Deng, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu:
Large-Order Multiple Recursive Generators with Modulus 231 - 1. INFORMS J. Comput. 24(4): 636-647 (2012) - Jonathan Eckstein, Noam Goldberg:
An Improved Branch-and-Bound Method for Maximum Monomial Agreement. INFORMS J. Comput. 24(2): 328-341 (2012) - Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos, Panayiotis Miliotis:
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem. INFORMS J. Comput. 24(2): 245-259 (2012) - Faramroze G. Engineer, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
The Fixed-Charge Shortest-Path Problem. INFORMS J. Comput. 24(4): 578-596 (2012) - Mohammad M. Fazel-Zarandi, J. Christopher Beck:
Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem. INFORMS J. Comput. 24(3): 387-398 (2012) - Soumyadip Ghosh, Raghu Pasupathy:
C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions. INFORMS J. Comput. 24(2): 295-310 (2012) - Bruce L. Golden, Zahra Naji Azimi, S. Raghavan, Majid Salari, Paolo Toth:
The Generalized Covering Salesman Problem. INFORMS J. Comput. 24(4): 534-553 (2012) - Simon Görtz, Andreas Klose:
A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem. INFORMS J. Comput. 24(4): 597-610 (2012) - Stefano Gualandi, Federico Malucelli:
Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation. INFORMS J. Comput. 24(1): 81-100 (2012) - Peter M. Hahn, Yi-Rong Zhu, Monique Guignard, William L. Hightower, Matthew J. Saltzman:
A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem. INFORMS J. Comput. 24(2): 202-209 (2012) - Zan Huang, Akhil Kumar:
A Study of Quality and Accuracy Trade-offs in Process Mining. INFORMS J. Comput. 24(2): 311-327 (2012) - Armann Ingolfsson, Ling Tang:
Efficient and Reliable Computation of Birth-Death Process Performance Measures. INFORMS J. Comput. 24(1): 29-41 (2012) - Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet:
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem. INFORMS J. Comput. 24(4): 554-564 (2012)
skipping 17 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-06-03 09:25 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