Multiple objective optimization and implications for single objective optimization.

MaRDI QIDQ3075630zbMATH OpenFDO

Authors Jochen Gorski

Publication date 16 February 2011

Full work available at URL http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-9589-9

zbMATH Keywords

biconvex optimizationcombinatorial optimization

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29)

Recommendations

• Connectedness of efficient solutions in multiple objective combinatorial optimization
• scientific article; zbMATH DE number 2160609
• Generalized multiple objective bottleneck problems
• scientific article; zbMATH DE number 2159075
• A survey and annotated bibliography of multiobjective combinatorial optimization

Cited in

(7)

• Bi-dimensional knapsack problems with one soft constraint
• Preprocessing and cut generation techniques for multi-objective binary programming
• Greedy algorithms for a class of knapsack problems with binary weights
• Finding multi-objective supported efficient spanning trees
• Multi-objective matroid optimization with ordinal weights
• Biobjective optimization problems on matroids with binary costs
• Connectedness of efficient solutions in multiple objective combinatorial optimization

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Multiple objective optimization and implications for single objective optimization.

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