An interactive approximation algorithm for multi-objective integer programs
From MaRDI portal
Publication:1652656
DOI10.1016/j.cor.2018.04.005zbMath1458.90578OpenAlexW2796586070WikidataQ129985586 ScholiaQ129985586MaRDI QIDQ1652656
Banu Lokman, Jyrki Wallenius, Pekka J. Korhonen, Murat M. Köksalan
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.04.005
Integer programming (90C10) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection ⋮ An interactive algorithm for resource allocation with balance concerns ⋮ Cone contraction and reference point methods for multi-criteria mixed integer optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- Finding all nondominated points of multi-objective integer programs
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Interactive evolutionary multi-objective optimization for quasi-concave preference functions
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An approach for finding the most preferred alternative in the presence of multiple criteria
- An interactive procedure for multiple objective integer linear programming problems
- An interactive algorithm for solving multiple objective integer linear programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An improved method for solving multiple criteria problems involving discrete alternatives
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- Use of Convex Cones in Interactive Multiple Objective Decision Making
- Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Multicriteria Optimization
This page was built for publication: An interactive approximation algorithm for multi-objective integer programs
