Efficient approximation algorithms for multi-objective constraint optimization
From MaRDI portal
Recommendations
- Constraint optimization techniques for exact multi-objective optimization
- Approximating the Pareto front of multi-criteria optimization problems
- scientific article; zbMATH DE number 1386739
- A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
- A constraint method in nonlinear multi-objective optimization
Cited in
(14)- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- scientific article; zbMATH DE number 2084716 (Why is no real title available?)
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Constraint optimization techniques for exact multi-objective optimization
- scientific article; zbMATH DE number 1386739 (Why is no real title available?)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- Boosting efficiency for computing the Pareto frontier on tree structured networks
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- Advancing local search approximations for multiobjective combinatorial optimization problems
- A Soft Approach to Multi-objective Optimization
- Approximating the Pareto front of multi-criteria optimization problems
- CHESS -- changing horizon efficient set search: a simple principle for multiobjective optimization
- A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
- scientific article; zbMATH DE number 5006219 (Why is no real title available?)
This page was built for publication: Efficient approximation algorithms for multi-objective constraint optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095300)