Optimizing a linear function over the nondominated set of multiobjective integer programs
From MaRDI portal
(Redirected from Publication:6091884)
Cites work
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- An algorithm for optimizing a linear function over an integer efficient set
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Computing the nadir point for multiobjective discrete optimization problems
- Finding all nondominated points of multi-objective integer programs
- Finding nadir points in multi-objective integer programs
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Optimizing a linear function over an efficient set
- Optimizing a linear function over an integer efficient set
- The \(L\)-shape search method for triobjective integer programming
- The maximization of a function over the efficient set via a penalty function approach
Cited in
(8)- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- scientific article; zbMATH DE number 404613 (Why is no real title available?)
- Optimization of a linear function over an integer efficient set
- Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II
- Optimization of a quadratic programming problem over an Integer efficient set
- Parallel optimization over the integer efficient set
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
- Optimizing a linear function over the Lorenz-efficient set of multi-objective combinatorial optimization problems
This page was built for publication: Optimizing a linear function over the nondominated set of multiobjective integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091884)
