Volume 4,
Number 1,
March 2000
- Ding-Zhu Du:
Editorial.
5-5 BibTeX
- Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
Facility Dispersion Problems Under Capacity and Cost Constraints.
7-33 BibTeX
- 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 BibTeX
- Y. Y. Li, Kwong-Sak Leung, C. K. Wong:
Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems.
79-98 BibTeX
- Xiufeng Du, Xiao-Dong Hu, Xiaohua Jia:
On Shortest k-Edge-Connected Steiner Networks in Metric Spaces.
99-107 BibTeX
- Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Sequence Independent Lifting in Mixed Integer Programming.
109-129 BibTeX
- Mohamed Didi Biha, Ali Ridha Mahjoub:
Steiner k-Edge Connected Subgraph Polyhedra.
131-144 BibTeX
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 BibTeX
- Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
171-186 BibTeX
- Marcus Brazil, D. A. Thomas, J. F. Weng:
On the Complexity of the Steiner Problem.
187-195 BibTeX
- Christoph Helmberg, Franz Rendl, Robert Weismantel:
A Semidefinite Programming Approach to the Quadratic Knapsack Problem.
197-215 BibTeX
- Guoliang Xue, Shangzhi Sun, David Hung-Chang Du, Lojun Shi:
An Efficient Algorithm for Delay Buffer Minimization.
217-233 BibTeX
- Zeev Nutov, Michal Penn:
On Integrality, Stability and Composition of Dicycle Packings and Covers.
235-251 BibTeX
- Mauro Dell'Amico, Francesco Maffioli:
Combining Linear and Non-Linear Objectives in Spanning Tree Problems.
253-269 BibTeX
- T. Cole:
A 75° Angle Constraint for Plane Minimal T1 Trees.
271-284 BibTeX
Volume 4,
Number 3,
September 2000
Volume 4,
Number 4,
December 2000
Copyright © Tue Nov 18 20:41:37 2008
by Michael Ley (ley@uni-trier.de)
