PolySCIP

DOI10.1007/978-3-319-42432-3_32zbMath1434.90004OpenAlexW4238163351MaRDI QIDQ2819226

Martin Skutella, Sebastian Schenker, Timo Strunk, Ralf Borndörfer

Publication date: 28 September 2016

Published in: Mathematical Software – ICMS 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42432-3_32

zbMATH Keywords

multi-objective optimizationefficient solutionsPareto-optimal solutionsmulti-criteria optimizationweight set decompositionnon-dominated pointsweight space partition

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Two‐phase strategies for the bi‐objective minimum spanning tree problem, Twenty years of continuous multiobjective optimization in the twenty-first century, PolySCIP

Uses Software

• SCIP
• CPLEX
• Gurobi
• SYMPHONY
• XPRESS
• LEMON
• BENSOLVE

Cites Work

• A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
• On the consistency of MPS
• SCIP: solving constraint integer programs
• An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
• Outcome space partition of the weight set in multiobjective linear programming
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• Vector Optimization with Infimum and Supremum
• An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Multicriteria Optimization