A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
From MaRDI portal
(Redirected from Publication:513166)
Recommendations
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An algorithm for solving convex programs subject to box constraints
- Covers and approximations in multiobjective optimization
- A spectral approach to solve box-constrained multi-objective optimization problems
- A new algorithm for box-constrained global optimization
- The cubic algorithm for global optimization with box and equality constraints and application to the optimal allocation of resources
- MAPLE code of the cubic algorithm for multiobjective optimization with box constraints
- A New Active Set Algorithm for Box Constrained Optimization
- A piecewise convexification method for non-convex multi-objective optimization programs with box constraints
- Algorithms and Computation
Cites work
- scientific article; zbMATH DE number 3833720 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 1975073 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- 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 robust bus evacuation model with delayed scenario information
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximation methods in multiobjective programming
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Branch and bound algorithms for the bus evacuation problem
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Finding representative systems for discrete bicriterion optimization problems
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- Nonlinear multiobjective optimization
- The \(L\)-shape search method for triobjective integer programming
- The triangle splitting method for biobjective mixed integer programming
- Towards finding global representations of the efficient set in multiple objective mathematical programming
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
Cited in
(8)- Representing the nondominated set in multi-objective mixed-integer programs
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Finding representative systems for discrete bicriterion optimization problems
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
- Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization
- Using box indices in supporting comparison in multiobjective optimization
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Generating representative sets for multiobjective discrete optimization problems with specified coverage errors
This page was built for publication: A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513166)
