Solving discrete multiobjective optimization problems based on approximation.

DOI10.1007/BF03398542MaRDI QIDQ2468570zbMATH OpenFDO

Authors Gregorio Nevado, Alfonso Mateos, Sixto Rios-Insua

Publication date 25 January 2008

Published in Opsearch (Search for Journal in Brave)

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3936913 (Why is no real title available?)
• scientific article; zbMATH DE number 3947944 (Why is no real title available?)
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 849083 (Why is no real title available?)
• scientific article; zbMATH DE number 3307201 (Why is no real title available?)
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Theory of multiobjective optimization
• What if utility functions do not exist?

This page was built for publication: Solving discrete multiobjective optimization problems based on approximation.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468570)