## On the Generation of Multiple Candidate Solutions for Discrete Optimization Problems

- S. Schwarz
- PhD Thesis, Faculty of Mathematics and Computer
- 2003

- Published 2004

The penalty method is a method to generate alternative solutions for many discrete optimization problems. A penalty parameter easily allows to have influence on the difference between optimal and alternative solution. We experimentally test the penalty method for three optimization problems (shortest paths, assignments, travelling salesman) with parameters that change between planning phase and realization phase. ∗sameith@mathematik.uni-jena.de

@inproceedings{Sameith2004OnTG,
title={On the Generation of Alternative Solutions for Discrete Optimization Problems with Uncertain Data — An Experimental Analysis of the Penalty Method},
author={J{\"{o}rg Sameith},
year={2004}
}