Остановите войну!
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 26 matches
- 2004
- Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau:
Design issues for combinatorial auctions. 4OR 2(1): 1-33 (2004) - Bruno Bachelet, Philippe Mahey:
Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR 2(4): 275-291 (2004) - Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - Jean-Pierre Barthélemy, François Brucker, Christophe Osswald:
Combinatorial optimization and hierarchical classifications. 4OR 2(3): 179-219 (2004) - Thierry Benoist, Benoît Rottembourg:
Upper bounds for revenue maximization in a satellite scheduling problem. 4OR 2(3): 235-249 (2004) - Patrizia Beraldi, Domenico Conforti, Chefi Triki, Antonio Violi:
Constrained auction clearing in the Italian electricity market. 4OR 2(1): 35-51 (2004) - Raymond Bisdorff:
Concordant outranking with multiple criteria of ordinal significance. 4OR 2(4): 293-308 (2004) - Jean-Pierre Brans, Giorgio Gallo:
Ethics in OR/MS: Past, present and future. 4OR 2(2): 95-110 (2004) - Alberto Caprara:
Knapsack problems: A book review. 4OR 2(4): 317-320 (2004) - Robert D. Carr, Giuseppe Lancia:
Compact optimization can outperform separation: A case study in structural proteomics. 4OR 2(3): 221-233 (2004) - Benoît Colson:
Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming. 4OR 2(1): 85-88 (2004) - Michelangelo Conforti, Romeo Rizzi:
Combinatorial optimization - Polyhedra and efficiency: A book review. 4OR 2(2): 153-159 (2004) - Emilie Danna:
Integrating local search techniques into mixed integer programming. 4OR 2(4): 321-324 (2004) - Giorgio Fasano:
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items. 4OR 2(2): 161-174 (2004) - Jakob Krarup, Malene Nordlund Rørbech:
LP formulations of the shortest path tree problem. 4OR 2(4): 259-274 (2004) - Roel Leus:
The generation of stable project plans. 4OR 2(3): 251-254 (2004) - Leo Liberti:
Reformulation and convex relaxation techniques for global optimization. 4OR 2(3): 255-258 (2004) - Silvano Martello:
Stefano Pallottino (1945-2004). 4OR 2(2): 93-93 (2004) - Jean François Maurras, Sonia Vanier:
Network synthesis under survivability constraints. 4OR 2(1): 53-67 (2004) - Mustafa Ç. Pinar:
A note on robust 0-1 optimization with uncertain cost coefficients. 4OR 2(4): 309-316 (2004) - Marc Sevaux, Kenneth Sörensen:
A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 4OR 2(2): 129-147 (2004) - Olivier Spanjaard:
Non-classical preference models in combinatorial problems: Models and algorithms for graphs. 4OR 2(4): 325-328 (2004) - Yurij Stoyan, Guntram Scheithauer, Nikolay Gil, Tatiana E. Romanova:
Phi-functions for complex 2D-objects. 4OR 2(1): 69-84 (2004) - Mathieu Van Vyve:
A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. 4OR 2(1): 89-91 (2004) - Annegret Wagler:
Antiwebs are rank-perfect. 4OR 2(2): 149-152 (2004) - Hande Yaman:
Concentrator location in telecommunications. 4OR 2(2): 175-177 (2004)
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-05-07 15:29 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