Volume 118,
Number 1-2,
April 2002
- Francisco Barahona, Ranga Anbil:
On some difficult linear programs coming from set partitioning.
3-11 BibTeX
- Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
A lower bound for the non-oriented two-dimensional bin packing problem.
13-24 BibTeX
- Ronald I. Becker, Yen-I Chiang, Isabella Lari, Andrea Scozzari, Giovanni Storchi:
Finding the l-core of a tree.
25-42 BibTeX
- Celso C. Ribeiro, Maurício C. Souza:
Variable neighborhood search for the degree-constrained minimum spanning tree problem.
43-54 BibTeX
- Pawel Winter, Martin Zachariasen, Jens Nielsen:
Short trees in polygons.
55-72 BibTeX
- Giulia Galbiati:
On the approximation of the Minimum Disturbance p-Facility Location Problem.
73-83 BibTeX
- Nysret Musliu, Johannes Gärtner, Wolfgang Slany:
Efficient generation of rotating workforce schedules.
85-98 BibTeX
- Gaia Nicosia, Dario Pacciarelli, Andrea Pacifici:
Optimally balancing assembly lines with different workstations.
99-113 BibTeX
- Edoardo Amaldi, Marco Mattavelli:
The MIN PFS problem and piecewise linear model estimation.
115-143 BibTeX
- Horst W. Hamacher, Karl-Heinz Küfer:
Inverse radiation therapy planning - a multiple objective optimization approach.
145-161 BibTeX
Volume 118,
Number 3,
May 2002
- Eddie Cheng, Marc J. Lipman:
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness.
163-179 BibTeX
- David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
Bounds for parametric sequence comparison.
181-198 BibTeX
- Toshihiro Fujito, Hiroshi Nagamochi:
A 2-approximation algorithm for the minimum weight edge dominating set problem.
199-207 BibTeX
- Xiaofeng Guo, Pierre Hansen, Maolin Zheng:
Boundary uniqueness of fusenes.
209-222 BibTeX
- Kiyoshi Hosono, Katsumi Matsuda:
On the perfect matching of disjoint compact sets by noncrossing line segments in Rn.
223-238 BibTeX
- Mohammad Mahdian:
On the computational complexity of strong edge coloring.
239-248 BibTeX
- Nancy Ann Neudauer:
Graph representations of a bicircular matroid.
249-262 BibTeX
- Arie Tamir, Justo Puerto, Dionisio Pérez-Brito:
The centdian subtree on tree networks.
263-278 BibTeX
- Takeo Yamada, Harunobu Kinoshita:
Finding all the negative cycles in a directed graph.
279-291 BibTeX
- Kenneth A. Berman, Jerome L. Paul:
Verifiable broadcasting and gossiping in communication networks.
293-298 BibTeX
- Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor:
Erratum to "Comparison of column generation models for channel assignment in cellular networks".
299-322 BibTeX
Copyright © Wed Jun 4 19:06:40 2008
by Michael Ley (ley@uni-trier.de)
