Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
From MaRDI portal
Recommendations
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
Cites work
- 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 modified weighted Tchebycheff metric for multiple objective programming
- 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
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- An algorithm for the multiple objective integer linear programming problem
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria 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 improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Efficient computation of the search region in multi-objective optimization
- Fathoming rules for biobjective mixed integer linear programs: review and extensions
- Finding all nondominated points of multi-objective integer programs
- Finding representative systems for discrete bicriterion optimization problems
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 3476270 (Why is no real title available?)
- scientific article; zbMATH DE number 3568375 (Why is no real title available?)
- Improved -constraint method for multiobjective programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective integer programming: an improved recursive algorithm
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multicriteria Optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Multi‐objective combinatorial optimization problems: A survey
- Norm-based approximation in multicriteria programming.
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On the representation of the search region in multi-objective optimization
- The problem of the optimal biobjective spanning tree
- Two phase algorithms for the bi-objective assignment problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Unbiased approximation in multicriteria optimization
- Using trade-off information in decision-making algorithms
Cited in
(24)- Multi-objective optimization using statistical models
- Evaluating solutions and solution sets under multiple objectives
- Decision programming for mixed-integer multi-stage optimization under uncertainty
- 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
- Fair resource allocation: using welfare-based dominance 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
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- 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
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
- Combining discrete and continuous information for multi-criteria optimization problems
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
- A class of weighted Tchebycheff preference relations and multi-objective optimization
- Optimizing the finnish colorectal cancer population screening program with decision programming
- A new order relation for set optimization problems on complete lattice structure
This page was built for publication: Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724117)
