A dual-based algorithm for solving lexicographic multiple objective programs.
Latif PourkarimiMasoud ZarepishehPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- preprocessing
- combinatorial optimization
- learning algorithm
- gradient projection
- computational complexity
- dynamic programming
- computational cost
- worst case
- cost function
- detection algorithm
- optimal solution
- linear programming problems
- primal dual
- multiple objectives
- matching algorithm
- region of interest
- segmentation algorithm
- particle swarm optimization algorithm
- particle swarm optimization
- multi objective
- shortest path problem
- special case
- search space