default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 12
Volume 12, May 2014
- Satoru Fujishige
, Shin-ichi Tanigawa, Yuichi Yoshida:
Generalized skew bisubmodularity: A characterization and a min-max theorem. 1-9 - Dirk Oliver Theis:
On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra. 10-25 - Alan J. Soper, Vitaly A. Strusevich:
Single parameter analysis of power of preemption on two and three uniform machines. 26-46 - Abraham P. Punnen, Sara Taghipour, Daniel Karapetyan, Bishnu Bhattacharyya:
The quadratic balanced optimization problem. 47-60 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Reliability problems in multiple path-shaped facility location on networks. 61-72 - Peter N. Malkin:
Sherali-Adams relaxations of graph isomorphism polytopes. 73-97 - Tamás Kis:
Lift-and-project for general two-term disjunctions. 98-114 - Satoru Fujishige:
Bisubmodular polyhedra, simplicial divisions, and discrete convexity. 115-120 - Satoru Iwata, Tibor Jordán:
Orientations and detachments of graphs with prescribed degrees and connectivity. 121-128 - Claudio Contardo, Rafael Martinelli:
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. 129-146 - Olivier Durand de Gevigney:
Decomposition into two trees with orientation constraints. 147-149 - Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Aleksander Vesel, Petra Zigert Pletersek:
Equal opportunity networks, distance-balanced graphs, and Wiener game. 150-154
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.
last updated on 2025-01-04 01:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
