Остановите войну!
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 33 matches
- 2009
- Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. 4OR 7(4): 301-335 (2009) - Thierry Benoist, Antoine Jeanjean, Pascal Molin:
Minimum Formwork Stock problem on residential buildings construction sites. 4OR 7(3): 275-288 (2009) - Jean-Charles Billaut, Francis Sourd:
Single machine scheduling with forbidden start times. 4OR 7(1): 37-50 (2009) - Denis Bouyssou, Silvano Martello, Frank Plastria:
No 7-year itch at 4OR. 4OR 7(1): 1-15 (2009) - Denis Bouyssou, Silvano Martello, Frank Plastria:
Plagiarism again: Sreenivas and Srinivas, with an update on Marcu. 4OR 7(1): 17-20 (2009) - Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich:
Operator non-availability periods. 4OR 7(3): 239-253 (2009) - Valentina Cacchiani:
Models and algorithms for combinatorial optimization problems arising in railway applications. 4OR 7(1): 109-112 (2009) - Lucile Denoeud-Belgacem:
Transfer distance between partitions and search of dense zones in graphs. 4OR 7(4): 395-398 (2009) - Augusto Eusébio, José Rui Figueira, Matthias Ehrgott:
A primal-dual simplex algorithm for bi-objective network flow problems. 4OR 7(3): 255-273 (2009) - Elisabeth Gassner, Bettina Klinz:
The computational complexity of bilevel assignment problems. 4OR 7(4): 379-394 (2009) - Dries R. Goossens, Frits C. R. Spieksma:
The transportation problem with exclusionary side constraints. 4OR 7(1): 51-60 (2009) - Michel Grabisch:
The core of games on ordered structures and graphs. 4OR 7(3): 207-238 (2009) - Stefano Gualandi:
Enhancing CP-based column generation for integer programs. 4OR 7(3): 289-292 (2009) - Stefano Gualandi, Federico Malucelli:
Constraint programming-based column generation. 4OR 7(2): 113-137 (2009) - Imed Kacem, Mohamed Haouari:
Approximation algorithms for single machine scheduling with one unavailability period. 4OR 7(1): 79-92 (2009) - Mostafa Khorramizadeh, Nezam Mahdavi-Amiri:
Integer extended ABS algorithms and possible control of intermediate results for linear Diophantine systems. 4OR 7(2): 145-167 (2009) - Christophe Lecluyse, Tom Van Woensel, Herbert Peremans:
Vehicle routing with stochastic time-dependent travel times. 4OR 7(4): 363-377 (2009) - Valeria Leggieri:
Multicast problems in telecommunication networks. 4OR 7(1): 105-108 (2009) - Enrico Malaguti:
The Vertex Coloring Problem and its generalizations. 4OR 7(1): 101-104 (2009) - Emanuele Manni:
Topics in real-time fleet management. 4OR 7(2): 203-206 (2009) - Jean François Maurras:
A family of easy polyhedra. 4OR 7(2): 139-144 (2009) - Patrick Meyer:
Progressive methods in multiple criteria decision analysis. 4OR 7(2): 191-194 (2009) - Stefano Moretti:
Game Theory applied to gene expression analysis. 4OR 7(2): 195-198 (2009) - Ugo Pietropaoli:
Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs. 4OR 7(3): 297-300 (2009) - Ornella Pisacane:
Agent scheduling in a multiskill call center. 4OR 7(2): 199-202 (2009) - Katrien Ramaekers:
A simulation optimisation approach for inventory management decision support based on incomplete information. 4OR 7(1): 93-96 (2009) - Sujit Kumar Samanta, Umesh Chandra Gupta, Mohan L. Chaudhry:
Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers. 4OR 7(4): 337-361 (2009) - Chefi Triki, Antonio Violi:
Dynamic pricing of electricity in retail markets. 4OR 7(1): 21-36 (2009) - Pieter Vansteenwegen:
Planning in tourism and public transportation. 4OR 7(3): 293-296 (2009) - Francesca Vocaturo:
Optimization via simulation for logistic systems planning and control. 4OR 7(1): 97-100 (2009)
skipping 3 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-08-26 08:46 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