Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
From MaRDI portal
Publication:625647
DOI10.1007/s10898-010-9541-9zbMath1209.90309OpenAlexW2037368754MaRDI QIDQ625647
Nikolaos Argyris, José Rui Figueira, Alec Morton
Publication date: 25 February 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9541-9
Related Items (4)
An interactive approximation algorithm for multi-objective integer programs ⋮ Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems ⋮ Scenario-based portfolio selection of investment projects with incomplete probability and utility information ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multiple objective interactive Lagrangean relaxation approach
- Bilevel programming: a survey
- A review of interactive methods for multiobjective integer and mixed-integer programming
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Weighting factor extensions for finite multiple objective vector minimization problems
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
- Solving zero-one multiple objective programs through implicit enumeration
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Resolving inconsistencies among constraints on the parameters of an MCDA model
- Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method
- Transparent prioritisation, budgeting and resource allocation with multi-criteria decision analysis and decision conferencing
- Dynamic Portfolio Selection of NPD Programs Using Marginal Returns
- Using mathematical programming heuristics in a multicriteria network flow context
- A combined approach to solve binary multicriteria problems
- An Algorithm for Multiobjective Zero-One Linear Programming
- Building Efficient Product Portfolios at John Deere and Company
- A mathematical basis for satisficing decision making
- An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Theory and algorithms for linear multiple objective programs with zero–one variables
- The Linear Multiple Choice Knapsack Problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Linear multiple objective programs with zero–one variables
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Discrete Programming by the Filter Method
This page was built for publication: Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
