default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 4
Volume 4, Number 1, March 2000
- Ding-Zhu Du:
Editorial. 5 - Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Facility Dispersion Problems Under Capacity and Cost Constraints. 7-33 - Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. 35-77 - Y. Y. Li, Kwong-Sak Leung, C. K. Wong:
Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems. 79-98 - Xiufeng Du, Xiao-Dong Hu, Xiaohua Jia:
On Shortest k-Edge-Connected Steiner Networks in Metric Spaces. 99-107 - Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
:
Sequence Independent Lifting in Mixed Integer Programming. 109-129 - Mohamed Didi Biha, Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra. 131-144
Volume 4, Number 2, June 2000
- Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki:
A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. 151-169 - Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. 171-186 - Marcus Brazil, Doreen A. Thomas, Jia F. Weng:
On the Complexity of the Steiner Problem. 187-195 - Christoph Helmberg, Franz Rendl, Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem. 197-215 - Guoliang Xue, Shangzhi Sun, David Hung-Chang Du, Lojun Shi:
An Efficient Algorithm for Delay Buffer Minimization. 217-233 - Zeev Nutov, Michal Penn:
On Integrality, Stability and Composition of Dicycle Packings and Covers. 235-251 - Mauro Dell'Amico, Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems. 253-269 - T. Cole:
A 75° Angle Constraint for Plane Minimal T1 Trees. 271-284
Volume 4, Number 3, September 2000
- Jieliang Zhou, Patrick W. Dymond, Xiaotie Deng:
Graph Algorithms with Small Communication Costs. 291-305 - Piotr Berman, Bhaskar DasGupta:
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. 307-323 - H. Edwin Romeijn, Nanda Piersma:
A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem. 325-355 - Bing Lu, Lu Ruan:
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. 357-363 - Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty:
Facets of an Assignment Problem with 0-1 Side Constraint. 365-388
Volume 4, Number 4, December 2000
- Robert D. Carr:
Some Results on Node Lifting of TSP Inequalities. 395-414 - Moshe Dror, Mohamed Haouari:
Generalized Steiner Problems and Other Variants. 415-436 - Cao An Wang, Bo-Ting Yang, Binhai Zhu:
On Some Polyhedra Covering Problems. 437-447 - Harold N. Gabow, Tibor Jordán:
Incrementing Bipartite Digraph Edge-Connectivity. 449-486 - Jie Wang:
Medial Axis and Optimal Locations for Min-Max Sphere Packing. 487-503
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-04 01:27 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:
