Sciweavers

AUSSOIS
2001
Springer
13 years 9 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
AUSSOIS
2001
Springer
13 years 9 months ago
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
Adam N. Letchford, Andrea Lodi
EMO
2001
Springer
225views Optimization» more  EMO 2001»
13 years 9 months ago
Application of Multiobjective Evolutionary Algorithms for Dose Optimization Problems in Brachytherapy
In High Dose Rate (HDR) brachytherapy the conventional dose optimization algorithms consider the multiple objectives in form of an aggregate function which combines individual obj...
Michael Lahanas, Natasa Milickovic, Dimos Baltas, ...
EMO
2001
Springer
209views Optimization» more  EMO 2001»
13 years 9 months ago
Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
Natasa Milickovic, Michael Lahanas, Dimos Baltas, ...
Optimization
Top of PageReset Settings