The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization
This paper presents a new general-purpose algorithm for exact solving of combinatorial many-objective optimization problems. We call this new algorithm the guided improvement algorithm. The algorithm is implemented on top of the non-optimizing relational constraint solver Kodkod. We compare the perf...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/1721.1/46322 |