Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
From MaRDI portal
Publication:724117
DOI10.1016/j.ejor.2018.05.036zbMath1403.90607OpenAlexW2804879587WikidataQ129766076 ScholiaQ129766076MaRDI QIDQ724117
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.036
Related Items (14)
Solution approaches for equitable multiobjective integer programming problems ⋮ On the exactness of the \(\varepsilon\)-constraint method for biobjective nonlinear integer programming ⋮ Finding non dominated points for multiobjective integer convex programs with linear constraints ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Supporting strategy selection in multiobjective decision problems under uncertainty and hidden requirements ⋮ Outer approximation algorithms for convex vector optimization problems ⋮ Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems ⋮ Multi-objective optimization using statistical models ⋮ Fair resource allocation: using welfare-based dominance constraints ⋮ Evaluating solutions and solution sets under multiple objectives ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the representation of the search region in multi-objective optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- A modified weighted Tchebycheff metric for multiple objective programming
- An algorithm for the multiple objective integer linear programming problem
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Norm-based approximation in multicriteria programming.
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Efficient computation of the search region in multi-objective optimization
- The problem of the optimal biobjective spanning tree
- Unbiased approximation in multicriteria optimization
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Using trade-off information in decision-making algorithms
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Two phase algorithms for the bi-objective assignment problem
- Finding representative systems for discrete bicriterion optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multi‐objective combinatorial optimization problems: A survey
- Multicriteria Optimization
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
