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