An interactive approximation algorithm for multi-objective integer programs
type: Item
instance of: scholarly article
title: An interactive approximation algorithm for multi-objective integer programs
zbMATH Open document ID: 1458.90578
author: Banu Lokman
author: Pekka J. Korhonen
author: Jyrki Wallenius
author: Murat Köksalan
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901609
zbMATH Keywords: multi-objective integer programming
zbMATH Keywords: approximation algorithm
zbMATH Keywords: interactive algorithm
describes a project that uses: MOIP_AIRA
MaRDI profile type: Publication
full work available at URL: j.cor.2018.04.005
OpenAlex ID: W2796586070
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: Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
cites work: Multicriteria Optimization
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Interactive evolutionary multi-objective optimization for quasi-concave preference functions
cites work: An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
cites work: Q3347651
cites work: An interactive procedure for multiple objective integer linear programming problems
cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
cites work: Solving the Discrete Multiple Criteria Problem using Convex Cones
cites work: An improved method for solving multiple criteria problems involving discrete alternatives
cites work: Identifying and ranking a most preferred subset of alternatives in the presence of multiple criteria
cites work: An approach for finding the most preferred alternative in the presence of multiple criteria
cites work: Finding all nondominated points of multi-objective integer programs
cites work: An interactive algorithm to find the most preferred solution of multi-objective integer programs
cites work: An interactive algorithm for solving multiple objective integer linear programming problems
cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions
cites work: Multi-objective integer programming: an improved recursive algorithm
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: Q3815146
Wikidata QID: Q129985586
DOI: 10.1016/J.COR.2018.04.005
description: scientific article; zbMATH DE number 6901609