An interactive algorithm to find the most preferred solution of multi-objective integer programs
From MaRDI portal
Publication:342783
DOI10.1007/s10479-014-1545-2zbMath1349.90740OpenAlexW2052368910MaRDI QIDQ342783
Banu Lokman, Jyrki Wallenius, Murat M. Köksalan, Pekka J. Korhonen
Publication date: 18 November 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1545-2
Related Items
Optimizing a linear fractional function over the integer efficient set ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ An interactive approximation algorithm for multi-objective integer programs ⋮ Goal programming approach for political districting in Santa Catarina state: Brazil ⋮ Balance in resource allocation problems: a changing reference approach ⋮ Interactive algorithms for a broad underlying family of preference functions ⋮ Interactive approaches for biobjective problems with progressively changing solution sets ⋮ Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs ⋮ An interactive approach for biobjective integer programs under quasiconvex preference functions ⋮ Evaluating solutions and solution sets under multiple objectives ⋮ An interactive algorithm for resource allocation with balance concerns ⋮ Finding nadir points in multi-objective integer programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding all nondominated points of multi-objective integer programs
- A review of interactive methods for multiobjective integer and mixed-integer programming
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A class of practical interactive branch and bound algorithms for multicriteria integer programming
- A reference direction approach to multiple objective integer linear programming
- An approach for finding the most preferred alternative in the presence of multiple criteria
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An improved method for solving multiple criteria problems involving discrete alternatives
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- A mathematical basis for satisficing decision making
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- Use of Convex Cones in Interactive Multiple Objective Decision Making
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
