Остановите войну!
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 35 matches
- 2011
- Francisco J. Arcelus, Satyendra Kumar, Gopalan Srinivasan:
Channel coordination with manufacturer's return policies within a newsvendor framework. 4OR 9(3): 279-297 (2011) - David Auger:
Combinatorial identification problems and graph powers. 4OR 9(4): 417-420 (2011) - Maria Battarra:
Exact and heuristic algorithms for routing problems. 4OR 9(4): 421-424 (2011) - Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts:
Airport runway scheduling. 4OR 9(2): 115-138 (2011) - Thierry Benoist, Bertrand Estellon, Frédéric Gardi, Romain Megel, Karim Nouioua:
LocalSolver 1.x: a black-box local-search solver for 0-1 programming. 4OR 9(3): 299-316 (2011) - Lucio Bianco, Massimiliano Caramia:
Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound. 4OR 9(4): 371-389 (2011) - Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin:
A large neighbourhood search heuristic for the aircraft and passenger recovery problem. 4OR 9(2): 139-157 (2011) - Maurizio Boccia, Serena di Muro, Francesco Mosca, Antonio Sforza, Claudio Sterle:
A fast heuristic for a three-dimensional non-convex domain loading problem. 4OR 9(1): 83-101 (2011) - Jack Brimberg, Henrik Juel, Mark-Christoph Körner, Anita Schöbel:
Locating a general minisum 'circle' on the plane. 4OR 9(4): 351-370 (2011) - Antonio Candelieri:
A hyper-solution framework for classification problems via metaheuristic approaches. 4OR 9(4): 425-428 (2011) - An Caris:
Simulation and optimisation of intermodal barge transport networks. 4OR 9(2): 211-214 (2011) - Claudia D'Ambrosio, Andrea Lodi:
Mixed integer nonlinear programming tools: a practical overview. 4OR 9(4): 329-349 (2011) - Laura Galli:
Combinatorial and robust optimisation models and algorithms for railway applications. 4OR 9(2): 215-218 (2011) - Olivier Durand de Gevigney, Frédéric Meunier, Christian Popa, Julien Reygner, Ayrin Romero:
Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree. 4OR 9(2): 175-188 (2011) - Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 29-48 (2011) - Rodolphe Giroudeau, Jean-Claude König, Benoît Valéry:
Erratum to: Scheduling UET-tasks on a star network: complexity and approximation. 4OR 9(1): 111 (2011) - Giorgio Gnecco:
Functional optimization by variable-basis approximation schemes. 4OR 9(1): 103-106 (2011) - Alexander Grigoriev, Joyce van Loon, Marc Uetz:
On the complexity of a bundle pricing problem. 4OR 9(3): 255-260 (2011) - Finn Verner Jensen, Thomas D. Nielsen:
Probabilistic decision graphs for optimization under uncertainty. 4OR 9(1): 1-28 (2011) - Mostafa Khorramizadeh, Nezam Mahdavi-Amiri:
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser's approach. 4OR 9(2): 159-173 (2011) - Chams Lahlou:
Letter to the Editors. 4OR 9(1): 113-114 (2011) - Ben Lauwens:
Stochastic hybrid simulation - With applications to wired and wireless queueing networks. 4OR 9(1): 107-110 (2011) - Federico Liberatore, Giovanni Righini, Matteo Salani:
A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9(1): 49-82 (2011) - Arnaud Liefooghe:
Metaheuristics for multiobjective optimisation - Cooperative approaches, uncertainty handling and application in logistics. 4OR 9(2): 219-222 (2011) - Jorge E. Mendoza:
Solving real-world vehicle routing problems in uncertain environments. 4OR 9(3): 321-324 (2011) - Jean-Noël Monette:
Solving scheduling problems from high-level models. 4OR 9(3): 317-320 (2011) - Wassila Ouerdane:
Multiple criteria decision aiding: a dialectical perspective. 4OR 9(4): 429-432 (2011) - Federica Ricca, Andrea Scozzari, Bruno Simeone:
Political districting: from classical models to recent approaches. 4OR 9(3): 223-254 (2011) - Amir Salehipour, Kenneth Sörensen, Peter Goos, Olli Bräysy:
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2): 189-209 (2011) - Andrea Tramontani:
Enhanced mixed integer programming techniques and routing problems. 4OR 9(3): 325-328 (2011)
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-07-04 15:41 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