![](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 34 matches
- 2006
- Agostinho Agra
, Miguel Fragoso Constantino:
Description of 2-integer continuous knapsack polyhedra. Discret. Optim. 3(2): 95-110 (2006) - Arianna Alfieri, Gaia Nicosia
, Andrea Pacifici
:
Exact algorithms for a discrete metric labeling problem. Discret. Optim. 3(3): 181-194 (2006) - Mourad Baïou, José R. Correa:
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation. Discret. Optim. 3(2): 123-135 (2006) - Egon Balas, Robert D. Carr, Matteo Fischetti, Neil Simonetti
:
New facets of the STS polytope generated from known facets of the ATS polytope. Discret. Optim. 3(1): 3-19 (2006) - Jørgen Bang-Jensen
, Gregory Z. Gutin, Anders Yeo:
Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs. Discret. Optim. 3(1): 86-94 (2006) - Reuven Bar-Yehuda, Dror Rawitz:
Using fractional primal-dual to schedule split intervals with demands. Discret. Optim. 3(4): 275-287 (2006) - Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira:
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discret. Optim. 3(3): 195-205 (2006) - Gareth Bendall, François Margot:
Minimum number of below average triangles in a weighted complete graph. Discret. Optim. 3(3): 206-219 (2006) - Gareth Bendall, François Margot:
Greedy-type resistance of combinatorial problems. Discret. Optim. 3(4): 288-298 (2006) - Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3(3): 220-229 (2006) - Agustín Bompadre, Moshe Dror, James B. Orlin
:
Improved bounds for vehicle routing solutions. Discret. Optim. 3(4): 299-316 (2006) - Alberto Caprara, Andrea Lodi, Silvano Martello, Michele Monaci
:
Packing into the smallest square: Worst-case analysis of lower bounds. Discret. Optim. 3(4): 317-326 (2006) - Kevin K. H. Cheung:
Facets of the independent path-matching polytope. Discret. Optim. 3(2): 111-122 (2006) - Takashi Doi, Toshihiro Fujito:
A primal-dual method for approximating tree cover with two weights. Discret. Optim. 3(3): 230-237 (2006) - Günes Erdogan
, Barbaros Ç. Tansel:
A note on a polynomial time solvable case of the quadratic assignment problem. Discret. Optim. 3(4): 382-384 (2006) - Özlem Ergun, James B. Orlin
:
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discret. Optim. 3(1): 78-85 (2006) - Ulrich Faigle, Leo Liberti
, Francesco Maffioli, Stefan Pickl:
Graphs and combinatorial optimization. Discret. Optim. 3(3): 179 (2006) - Samuel Fiorini:
How to recycle your facets. Discret. Optim. 3(2): 136-153 (2006) - Alexander Grigoriev
, Joris van de Klundert
:
On the high multiplicity traveling salesman problem. Discret. Optim. 3(1): 50-62 (2006) - Gregory Z. Gutin, Abraham P. Punnen:
The traveling salesman problem. Discret. Optim. 3(1): 1 (2006) - Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra:
Algorithms for time-dependent bicriteria shortest path problems. Discret. Optim. 3(3): 238-254 (2006) - Dorit S. Hochbaum, Asaf Levin
:
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discret. Optim. 3(4): 327-340 (2006) - Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi:
Augmenting forests to meet odd diameter requirements. Discret. Optim. 3(2): 154-164 (2006) - Tamás Kis
:
Polyhedral results on single node variable upper-bound flow models with allowed configurations. Discret. Optim. 3(4): 341-353 (2006) - Sigrid Knust, Michael von Thaden:
Balanced home-away assignments. Discret. Optim. 3(4): 354-365 (2006) - Alexander V. Kononov, Bertrand M. T. Lin
:
On relocation problems with multiple identical working crews. Discret. Optim. 3(4): 366-381 (2006) - Ramesh Krishnamurti, Daya Ram Gaur
, Subir Kumar Ghosh, Horst Sachs:
Berge's theorem for the maximum charge problem. Discret. Optim. 3(2): 174-178 (2006) - Hoong Chuin Lau
, Trung Hieu Ngo, Bao Nguyen Nguyen:
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics. Discret. Optim. 3(4): 385-391 (2006) - Vicky Mak
, Natashia Boland
:
Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs. Discret. Optim. 3(1): 33-49 (2006) - Gerhard F. Post, Gerhard J. Woeginger:
Sports tournaments, home-away assignments, and the break minimization problem. Discret. Optim. 3(2): 165-173 (2006)
skipping 4 more matches
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-26 03:58 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