Computational complexity of multicriterion optimization

DOI10.1007/BF01127783MaRDI QIDQ684983zbMATH OpenOpenAlexFDO

Authors N. M. Popov

Publication date 16 September 1993

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01127783

zbMATH Keywords

approximation of the Pareto optimal set

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Abstract computational complexity for mathematical programming problems (90C60)

Review text

See the review in Zbl 0712.90062.

Cited in

(1)

• scientific article; zbMATH DE number 4172753 (Why is no real title available?)

This page was built for publication: Computational complexity of multicriterion optimization

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