Solution methods for multi-objective robust combinatorial optimization

MaRDI QIDQ4578073zbMATH OpenFDO

Authors Lisa Thom

Publication date 7 August 2018

Full work available at URL http://d-nb.info/115709466X/34, http://hdl.handle.net/11858/00-1735-0000-002E-E3D4-D

Mathematics Subject Classification ID

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

Recommendations

• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Concepts of robustness for uncertain multi-objective optimization
• On robust multiobjective optimization
• Robust optimization model for uncertain multiobjective linear programs
• Decision uncertainty in multiobjective optimization

Cited in

(4)

• scientific article; zbMATH DE number 6263561 (Why is no real title available?)
• Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions
• On universal and multiobjective model extensions for combinatorial optimization problems
• Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)

This page was built for publication: Solution methods for multi-objective robust combinatorial optimization

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