Остановите войну!
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 17 matches
- 2006
- Peter Broström, Kaj Holmberg:
Multiobjective design of survivable IP networks. Ann. Oper. Res. 147(1): 235-253 (2006) - Matthias Ehrgott:
A discussion of scalarization techniques for multiple objective integer programming. Ann. Oper. Res. 147(1): 343-360 (2006) - Matthias Ehrgott, José Rui Figueira, Xavier Gandibleux:
Preface. Ann. Oper. Res. 147(1): 1-3 (2006) - Armin Fügenschuh, Alexander Martin:
A multicriteria approach for optimizing bus schedules and school starting times. Ann. Oper. Res. 147(1): 199-216 (2006) - Fabien Le Huédé, Michel Grabisch, Christophe Labreuche, Pierre Savéant:
MCS - A new algorithm for multicriteria optimisation in constraint programming. Ann. Oper. Res. 147(1): 143-174 (2006) - Hadrien Hugot, Daniel Vanderpooten, Jean Michel Vanpeperstraete:
A bi-criteria approach for the data association problem. Ann. Oper. Res. 147(1): 217-234 (2006) - Panagiotis Kouvelis, Serpil Sayin:
Algorithm robust for the bicriteria discrete optimization problem. Ann. Oper. Res. 147(1): 71-85 (2006) - Marek Libura, Yury Nikulin:
Stability and accuracy functions in multicriteria linear combinatorial optimization problems. Ann. Oper. Res. 147(1): 255-267 (2006) - Carlo Meloni, David Naso, Biagio Turchiano:
Setup coordination between two stages of a production system: A multi-objective evolutionary approach. Ann. Oper. Res. 147(1): 175-198 (2006) - Matthias Müller-Hannemann, Karsten Weihe:
On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. 147(1): 269-286 (2006) - Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco:
A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147(1): 5-21 (2006) - Patrice Perny, Olivier Spanjaard, Louis-Xavier Storme:
A decision-theoretic approach to robust optimization in multivalued graphs. Ann. Oper. Res. 147(1): 317-341 (2006) - Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo:
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. Ann. Oper. Res. 147(1): 23-41 (2006) - Ted K. Ralphs, Matthew J. Saltzman, Margaret M. Wiecek:
An improved algorithm for solving biobjective integer programs. Ann. Oper. Res. 147(1): 43-70 (2006) - Bernard Roy, Roman Slowinski:
Multi-criteria assignment problem with incompatibility and capacity constraints. Ann. Oper. Res. 147(1): 287-316 (2006) - Minghe Sun:
A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization. Ann. Oper. Res. 147(1): 87-107 (2006) - Juan G. Villegas, Fernando Palacios, Andrés L. Medaglia:
Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example. Ann. Oper. Res. 147(1): 109-141 (2006)
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-20 16:47 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