Using weighted-sum functions to compute nonsupported efficient solutions in multiobjective combinatorial-{0,1} problems

International Journal of Information Technology and Decision Making

Volumn 12, Issue 1, 2013, Pages 27-44

  Gomes Da Silva, Carlos ^a,b   Clímaco, João ^c  

^a POLYTECHNIC INSTITUTE OF LEIRIA   (Portugal)

^b INESC COIMBRA   (Portugal)

^c UNIVERSITY OF COIMBRA   (Portugal)

Author keywords

approximate methods; combinatorial 0,1 problems; efficient solutions; exact methods; Multiobjective

Indexed keywords

EID: 84874795680     PISSN: 02196220     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219622013500028     Document Type: Article

References (8)

1. M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spektrum 22 (2000) 425-460.
2. M. Ehrgott and X. Gandibleux, Approximate solution methods for multiobjective combinatorial optimization, TOP 12 (2004) 1-90.
3. H. Isermann, Proper efficiency and the linear vector maximum problem, Operations Research 22 (1974) 189-191.
4. R. Steuer, Multiple Criteria Optimization: Theory, Computation and Application (John Wiley & Sons, New York, 1986).
5. I. Charon and O. Hudry, The noising method: A new combinatorial method, Operations Research Letters 14 (1993) 133-137.
6. I. Charon and O. Hudry, The noising methods: A generalization of some metaheuristics, European Journal of Operational Research 135 (2001) 86-101.
7. A. Geoffrion, Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications 22 (1968) 618-630.
8. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (John Wiley & Sons, New York, 1990).