Solution approaches for equitable multiobjective integer programming problems
From MaRDI portal
Recommendations
- Advancing equitability in multiobjective programming
- Piecewise \(w^\infty\)-equitable efficiency in multiobjective programming
- Piecewise equitable efficiency in multiobjective programming
- Equitable aggregations and multiple criteria analysis
- Generalized equitable preference in multiobjective programming
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1149798 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Advancing equitability in multiobjective programming
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- Capturing preferences for inequality aversion in decision support
- Equitable aggregations and multiple criteria analysis
- Finding a representative nondominated set for multi-objective mixed integer programs
- Finding all nondominated points of multi-objective integer programs
- Inequity averse optimization in operational research
- Linear optimization with multiple equitable criteria
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective integer programming: an improved recursive algorithm
- Multiobjective combinatorial optimization: some approaches
- Multiobjective linear and integer programming
- Multi‐objective combinatorial optimization problems: A survey
- On solving linear programs with the ordered weighted averaging objective.
- Preference Convex Unanimity in Multiple Criteria Decision Making
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Solving efficiently the 0-1 multi-objective knapsack problem
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
Cited in
(4)
This page was built for publication: Solution approaches for equitable multiobjective integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2150765)
