Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization

DOI10.1016/j.cor.2015.07.006zbMath1349.90745OpenAlexW1895513171MaRDI QIDQ342154

Yves De Smet, Julien Roland, José Rui Figueira

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.07.006

zbMATH Keywords

combinatorial optimizationmultiple objective programminginverse optimization

Mathematics Subject Classification ID

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

Related Items (3)

Dual mean field search for large scale linear and quadratic knapsack problems ⋮ Inverse optimization with kernel regression: application to the power forecasting and bidding of a fleet of electric vehicles ⋮ Interactive portfolio selection involving multicriteria sorting models

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recruitment and selection processes through an effective GDSS
• Aggregating individual judgments and priorities with the analytic hierarchy process
• Inverse multi-objective combinatorial optimization
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• Encyclopedia of Distances

This page was built for publication: Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization