An interactive algorithm to find the most preferred solution of multi-objective integer programs
From MaRDI portal
Publication:342783
DOI10.1007/S10479-014-1545-2zbMATH Open1349.90740OpenAlexW2052368910MaRDI QIDQ342783FDOQ342783
Authors: Banu Lokman, Jyrki Wallenius, Murat 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
Recommendations
- An interactive approximation algorithm for multi-objective integer programs
- An interactive algorithm for solving multiple objective integer linear programming problems
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- scientific article; zbMATH DE number 721841
- An interactive procedure for multiple objective integer linear programming problems
- scientific article; zbMATH DE number 3891118
- An interactive method for multiple-objective mathematical programming problems
- scientific article; zbMATH DE number 3978851
- scientific article; zbMATH DE number 3891122
Cites Work
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A mathematical basis for satisficing decision making
- Title not available (Why is that?)
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
- Finding all nondominated points of multi-objective integer programs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Title not available (Why is that?)
- Use of Convex Cones in Interactive Multiple Objective Decision Making
- 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
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- An improved method for solving multiple criteria problems involving discrete alternatives
- Title not available (Why is that?)
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- 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
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
Cited In (16)
- Optimizing a linear fractional function over the integer efficient set
- Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems
- Title not available (Why is that?)
- Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs
- Solution approaches for equitable multiobjective integer programming problems
- Interactive approaches for biobjective problems with progressively changing solution sets
- An interactive algorithm for resource allocation with balance concerns
- Interactive algorithms for a broad underlying family of preference functions
- Balance in resource allocation problems: a changing reference approach
- Goal programming approach for political districting in Santa Catarina state: Brazil
- Evaluating solutions and solution sets under multiple objectives
- An interactive approach for biobjective integer programs under quasiconvex preference functions
- Finding nadir points in multi-objective integer programs
- An interactive approximation algorithm for multi-objective integer programs
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- Un algoritmo interactivo basado en la distancia del maximo ponderado
This page was built for publication: An interactive algorithm to find the most preferred solution of multi-objective integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342783)
