Sciweavers

74
Voted
NETWORKS
1998
15 years 1 months ago
A branch and cut algorithm for the Steiner problem in graphs
Abilio Lucena, J. E. Beasley
76
Voted
NETWORKS
1998
15 years 1 months ago
How to test a tree
Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walk...
NETWORKS
1998
15 years 1 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
73
Voted
NETWORKS
1998
15 years 1 months ago
A branch-and-cut algorithm for the undirected selective traveling salesman problem
Michel Gendreau, Gilbert Laporte, Fréd&eacu...
NETWORKS
1998
15 years 1 months ago
Process network synthesis: Problem definition
Ferenc Friedler, L. T. Fan, Balázs Imreh
90
Voted
NETWORKS
1998
15 years 1 months ago
Approximating Steiner trees in graphs with restricted weights
Magnús M. Halldórsson, Shuichi Ueno,...
120
Voted
NCA
2002
IEEE
15 years 1 months ago
The Construction of Smooth Models using Irregular Embeddings Determined by a Gamma Test Analysis
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...
Alban P. M. Tsui, Antonia J. Jones, A. Guedes de O...
NCA
2002
IEEE
15 years 1 months ago
Comparison of Algorithmic and Machine Learning Approaches for the Automatic Fitting of Gaussian Peaks
Fitting gaussian peaks to experimental data is important in many disciplines, including nuclear spectroscopy. Nonlinear least squares fitting methods have been in use for a long t...
Radwan E. Abdel-Aal