An interactive algorithm to find the most preferred solution of multi-objective integer programs
type: Item
instance of: scholarly article
title: An interactive algorithm to find the most preferred solution of multi-objective integer programs
zbMATH Open document ID: 1349.90740
author: Banu Lokman
author: Jyrki Wallenius
author: Murat Köksalan
author: Pekka J. Korhonen
published in: Annals of Operations Research
publication date: 2016-11-18T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6654537
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: integer programming
zbMATH Keywords: linear programming
zbMATH Keywords: convex cones
MaRDI profile type: Publication
full work available at URL: s10479-014-1545-2
OpenAlex ID: W2052368910
cites work: Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
cites work: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
cites work: A review of interactive methods for multiobjective integer and mixed-integer programming
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: A reference direction approach to multiple objective integer linear programming
cites work: Q3347656
cites work: An improved method for solving multiple criteria problems involving discrete alternatives
cites work: Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
cites work: An approach for finding the most preferred alternative in the presence of multiple criteria
cites work: Solving the Discrete Multiple Criteria Problem using Convex Cones
cites work: Finding all nondominated points of multi-objective integer programs
cites work: An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
cites work: An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
cites work: Use of Convex Cones in Interactive Multiple Objective Decision Making
cites work: Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
cites work: A class of practical interactive branch and bound algorithms for multicriteria integer programming
cites work: Q3035161
cites work: Q3815146
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
cites work: A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
cites work: A mathematical basis for satisficing decision making
cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems
cites work: An Interactive Programming Method for Solving the Multiple Criteria Problem
cites work: An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
DOI: 10.1007/S10479-014-1545-2
Recommended article: An interactive approximation algorithm for multi-objective integer programs
Recommended article: An interactive algorithm for solving multiple objective integer linear programming problems
Recommended article: An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
Recommended article: Q4322790
Recommended article: An interactive procedure for multiple objective integer linear programming problems
Recommended article: Q3347651
Recommended article: An interactive method for multiple-objective mathematical programming problems
Recommended article: Q3743134
Recommended article: Q3347656
description: scientific article; zbMATH DE number 6654537