An Algorithm for Approximating High-Order Pareto Frontier in Multiobjective Integer Linear Problems
An algorithm for approximating the Pareto frontier (PF) in multiobjective integer linear problems is presented. As known, the feasible set in the objective space (FSOS) for an integer linear programming problem is not convex and only a few points of its Pareto frontier (so called supported points) c...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | lecture |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10174/4543 |
| País: | Portugal |
| Oai: | oai:dspace.uevora.pt:10174/4543 |