An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set.
Syuuji YamadaTetsuzo TaninoMasahiro InuiguchiPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- optimization method
- high accuracy
- optimization algorithm
- optimization process
- detection method
- method finds
- evolutionary algorithm
- significant improvement
- highly efficient
- computational cost
- segmentation method
- helmholtz principle
- closed form
- high precision
- classification method
- computationally efficient
- input data
- feature set
- probabilistic model
- preprocessing
- support vector machine
- combinatorial optimization
- convergence rate
- dynamic programming
- initial set
- objective function
- data sets