An efficient branch-and-bound algorithm to optimize a function over a nondominated set
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 219844 (Why is no real title available?)
- A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A hybrid approach for biobjective optimization
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A method for optimizing over the integer efficient set
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- Algorithms for the vector maximization problem
- An Algorithm for Multiobjective Zero-One Linear Programming
- An algorithm for optimizing a linear function over an integer efficient set
- An algorithm for the multiple objective integer linear programming problem
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Branch-and-bound and objective branching with three or more objectives
- Branch-and-bound for bi-objective integer programming
- Careful usage of pessimistic values is needed in multiple objectives optimization
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- Computing representations using hypervolume scalarizations
- Computing the nadir point for multiobjective discrete optimization problems
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Existence of efficient solutions for vector maximization problems
- Finding non dominated points for multiobjective integer convex programs with linear constraints
- Multi-objective branch and bound
- Multicriteria Optimization
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Nonlinear multiobjective optimization
- Optimization of a linear function over an integer efficient set
- Optimization of a quadratic programming problem over an Integer efficient set
- Optimization over the efficient set
- Optimization over the efficient set: Four special cases
- Optimization over the efficient set: overview
- Optimizing a linear function over an efficient set
- Optimizing a linear function over an integer efficient set
- Optimizing a linear function over the nondominated set of multiobjective integer programs
- Primal and dual algorithms for optimization over the efficient set
- Solving multiobjective mixed integer convex optimization problems
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- The maximization of a function over the efficient set via a penalty function approach
- Theory of multiobjective optimization
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
This page was built for publication: An efficient branch-and-bound algorithm to optimize a function over a nondominated set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918536)
