![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 25 matches
- 2010
- Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
:
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7(3): 136-148 (2010) - Igor Averbakh:
Minmax regret bottleneck problems with solution-induced interval uncertainty structure. Discret. Optim. 7(3): 181-190 (2010) - Fatiha Bendali, I. Diarrassouba, Ali Ridha Mahjoub, Jean Mailfert:
The k edge-disjoint 3-hop-constrained paths polytope. Discret. Optim. 7(4): 222-233 (2010) - Péter Biró, Tamás Fleiner:
The integral stable allocation problem on graphs. Discret. Optim. 7(1-2): 64-73 (2010) - Alberto Caprara, Andrea Lodi, Michele Monaci
:
An approximation scheme for the two-stage, two-dimensional knapsack problem. Discret. Optim. 7(3): 114-124 (2010) - Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis:
Labeled Traveling Salesman Problems: Complexity and approximation. Discret. Optim. 7(1-2): 74-85 (2010) - Vladimir G. Deineko, Gerhard J. Woeginger:
Pinpointing the complexity of the interval min-max regret knapsack problem. Discret. Optim. 7(4): 191-196 (2010) - Santanu S. Dey
, Laurence A. Wolsey:
Composite lifting of group inequalities and an application to two-row mixing inequalities. Discret. Optim. 7(4): 256-268 (2010) - György Dósa, Zhiyi Tan
:
New upper and lower bounds for online scheduling with machine cost. Discret. Optim. 7(3): 125-135 (2010) - Vladimir A. Emelichev, Dmitry Podkopaev
:
Quantitative stability analysis for vector problems of 0-1 programming. Discret. Optim. 7(1-2): 48-63 (2010) - Takuro Fukunaga
, Hiroshi Nagamochi:
Network design with weighted degree constraints. Discret. Optim. 7(4): 246-255 (2010) - Liliana Grigoriu, Donald K. Friesen:
Scheduling on same-speed processors with at most one downtime on each machine. Discret. Optim. 7(4): 212-221 (2010) - Mohamed Haouari
, Safa Bhar Layeb
, Hanif D. Sherali:
Algorithmic expedients for the Prize Collecting Steiner Tree Problem. Discret. Optim. 7(1-2): 32-47 (2010) - Géraldine Heilporn
, Jean-François Cordeau, Gilbert Laporte:
The Delivery Man Problem with time windows. Discret. Optim. 7(4): 269-282 (2010) - Yusuke Kobayashi:
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs. Discret. Optim. 7(4): 197-202 (2010) - Yusuke Kobayashi, Christian Sommer:
On shortest disjoint paths in planar graphs. Discret. Optim. 7(4): 234-245 (2010) - Olivier Marchetti, Alix Munier Kordon:
Complexity results for Weighted Timed Event Graphs. Discret. Optim. 7(3): 166-180 (2010) - Anthony Przybylski, Xavier Gandibleux
, Matthias Ehrgott
:
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discret. Optim. 7(3): 149-165 (2010) - Michal Przykucki
, Malgorzata Sulkowska:
Gusein-Zade problem for directed path. Discret. Optim. 7(1-2): 13-20 (2010) - Shengning Qiao:
On zeroth-order general Randic index of quasi-tree graphs containing cycles. Discret. Optim. 7(3): 93-98 (2010) - Gerhard Reinelt, Klaus Michael Wenger:
Generating partitions of a graph into a fixed number of minimum weight cuts. Discret. Optim. 7(1-2): 1-12 (2010) - Wai Chee Shiu, Xue-Gang Chen
, Wai Hong Chan:
Triangle-free graphs with large independent domination number. Discret. Optim. 7(1-2): 86-92 (2010) - Rodrigo Ferreira da Silva, Sebastián Urrutia
:
A General VNS heuristic for the traveling salesman problem with time windows. Discret. Optim. 7(4): 203-211 (2010) - Rüdiger Stephan:
Cardinality constrained combinatorial optimization: Complexity and polyhedra. Discret. Optim. 7(3): 99-113 (2010) - Doreen A. Thomas
, Jia F. Weng:
Computing Steiner points for gradient-constrained minimum networks. Discret. Optim. 7(1-2): 21-31 (2010)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-29 03:12 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