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