Остановите войну!
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 31 matches
- 2013
- Eduardo Álvarez-Miranda, Ivana Ljubic, Paolo Toth:
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11(4): 349-360 (2013) - Saman Babaie-Kafaki:
A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization. 4OR 11(4): 361-374 (2013) - Ruibin Bai, Tom Van Woensel, Graham Kendall, Edmund K. Burke:
A new model and a hyper-heuristic approach for two-dimensional shelf space allocation. 4OR 11(1): 31-55 (2013) - Kris Braekers:
Optimization of empty container movements in intermodal transport. 4OR 11(3): 299-300 (2013) - Herwig Bruneel, Willem Mélange, Bart Steyaert, Dieter Claeys, Joris Walraevens:
Effect of global FCFS and relative load distribution in two-class queues with dedicated servers. 4OR 11(4): 375-391 (2013) - Leandro C. Coelho:
Flexibility and consistency in inventory-routing. 4OR 11(3): 297-298 (2013) - Stefano Coniglio:
On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints. 4OR 11(1): 95-96 (2013) - Alberto Costa:
Applications of reformulations in mathematical programming. 4OR 11(3): 295-296 (2013) - Vladimir G. Deineko, Gerhard J. Woeginger:
Complexity and in-approximability of a selection problem in robust optimization. 4OR 11(3): 249-252 (2013) - Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester:
Speeding up Martins' algorithm for multiple objective shortest path problems. 4OR 11(4): 323-348 (2013) - Pablo A. Maya Duque:
Optimisation models and algorithms for non-profit logistics and disaster management problems. 4OR 11(4): 397-398 (2013) - Makhlouf Hadji:
On the design of networks with unicyclic connected components. 4OR 11(2): 197-198 (2013) - Claudio Iuliano:
Efficient deterministic algorithms for finding optimal cycle bases in undirected graphs. 4OR 11(4): 393-394 (2013) - Pierre Janssen, Philippe Nemery:
An extension of the FlowSort sorting method to deal with imprecision. 4OR 11(2): 171-193 (2013) - Oumar Koné:
New approaches for solving the resource-constrained project scheduling problem. 4OR 11(1): 93-94 (2013) - Martine Labbé, Alessia Violin:
Bilevel programming and price setting problems. 4OR 11(1): 1-30 (2013) - Veronique Limère:
To kit or not to kit: optimizing part feeding in the automotive assembly industry. 4OR 11(1): 97-98 (2013) - Marco Locatelli, Fabio Schoen:
Global optimization based on local searches. 4OR 11(4): 301-321 (2013) - Karel De Loof, Bernard De Baets, Hans E. De Meyer:
A necessary 4-cycle condition for dice representability of reciprocal relations. 4OR 11(2): 151-170 (2013) - Marie-Eléonore Marmion:
Local search and combinatorial optimization: from structural analysis of a problem to efficient algorithms design. 4OR 11(1): 99-100 (2013) - Carla Michini:
The stable set problem: some structural properties and relaxations. 4OR 11(2): 199-200 (2013) - Nenad Mladenovic, Dragan Urosevic, Saïd Hanafi:
Variable neighborhood search for the travelling deliveryman problem. 4OR 11(1): 57-73 (2013) - Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco, Ana Laranjeira:
Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11(3): 275-294 (2013) - Victor Pillac:
Dynamic vehicle routing: Solution methods and computational tools. 4OR 11(4): 395-396 (2013) - Michael Poss:
Robust combinatorial optimization with variable budgeted uncertainty. 4OR 11(1): 75-92 (2013) - Roberto Roberti:
Exact algorithms for different classes of vehicle routing problems. 4OR 11(2): 195-196 (2013) - Clara Rocha, Luis C. Dias:
MPOC: an agglomerative algorithm for multicriteria partially ordered clustering. 4OR 11(3): 253-273 (2013) - Carlos Segura, Carlos A. Coello Coello, Gara Miranda, Coromoto León:
Using multi-objective evolutionary algorithms for single-objective optimization. 4OR 11(3): 201-228 (2013) - El-Ghazali Talbi:
Combining metaheuristics with mathematical programming, constraint programming and machine learning. 4OR 11(2): 101-150 (2013) - Acknowledgement to referees. 4OR 11(4): 399-400 (2013)
skipping 1 more match
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-07 20:06 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