Sciweavers

59
Voted
NETWORKS
1998
14 years 12 months ago
Fault-tolerant graphs for tori
Toshinori Yamada, Shuichi Ueno
59
Voted
NETWORKS
1998
14 years 12 months ago
A polynomial algorithm for the p-centdian problem on a tree
Arie Tamir, Dionisio Pérez-Brito, Jos&eacut...
61
Voted
NETWORKS
1998
14 years 12 months ago
A branch and cut algorithm for the Steiner problem in graphs
Abilio Lucena, J. E. Beasley
66
Voted
NETWORKS
1998
14 years 12 months ago
Solving Steiner tree problems in graphs to optimality
Thorsten Koch, Alexander Martin
62
Voted
NETWORKS
1998
14 years 12 months ago
How to test a tree
Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walk...
NETWORKS
1998
14 years 12 months ago
Project scheduling with multiple modes: A comparison of exact algorithms
This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple exec...
Sönke Hartmann, Andreas Drexl
64
Voted
NETWORKS
1998
14 years 12 months ago
A branch-and-cut algorithm for the undirected selective traveling salesman problem
Michel Gendreau, Gilbert Laporte, Fréd&eacu...
NETWORKS
1998
14 years 12 months ago
Process network synthesis: Problem definition
Ferenc Friedler, L. T. Fan, Balázs Imreh
79
Voted
NETWORKS
1998
14 years 12 months ago
Approximating Steiner trees in graphs with restricted weights
Magnús M. Halldórsson, Shuichi Ueno,...