Approximation with a fixed number of solutions of some multiobjective maximization problems
From MaRDI portal
Recommendations
- Approximation with a fixed number of solutions of some biobjective maximization problems
- Small approximate Pareto sets for biobjective shortest paths and other problems
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
- Approximation methods for multiobjective and parametric optimization problems
Cites work
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 177561 (Why is no real title available?)
- scientific article; zbMATH DE number 1303558 (Why is no real title available?)
- scientific article; zbMATH DE number 1182772 (Why is no real title available?)
- A Lagrangian relaxation approach to the edge-weighted clique problem
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Approximability of maximum splitting of k-sets and some other Apx-complete problems
- Approximating multiobjective knapsack problems
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Fundamentals of Computation Theory
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved approximations for max set splitting and max NAE SAT
- Introduction to algorithms.
- Multicriteria Optimization
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Non-monotone submodular maximization under matroid and knapsack constraints
- On approximating multicriteria \textsc{TSP}
- On approximation of max-vertex-cover
- On the \(k\)-coloring of intervals
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Paths, Trees, and Flowers
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Reducibility among combinatorial problems
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Some optimal inapproximability results
- The dense \(k\)-subgraph problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
Cited in
(12)- scientific article; zbMATH DE number 3942321 (Why is no real title available?)
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- The power of the weighted sum scalarization for approximating multiobjective optimization problems
- Streaming submodular maximization with the chance constraint
- A scheme of approximation solution of problem 1 |r j|L max
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximating multiobjective optimization problems: how exact can you be?
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory
- Approximation methods for multiobjective and parametric optimization problems
- The biobjective minimum-cost perfect matching problem and Chinese postman problem
- Approximation with a fixed number of solutions of some biobjective maximization problems
- Bi-objective matchings with the triangle inequality
This page was built for publication: Approximation with a fixed number of solutions of some multiobjective maximization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396664)
