Approximation with a fixed number of solutions of some multiobjective maximization problems
From MaRDI portal
Publication:396664
DOI10.1016/j.jda.2013.06.006zbMath1334.68299OpenAlexW2105591103MaRDI QIDQ396664
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.006
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (4)
Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Streaming submodular maximization with the chance constraint ⋮ Bi-objective matchings with the triangle inequality ⋮ The power of the weighted sum scalarization for approximating multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem
- Approximability of maximum splitting of k-sets and some other Apx-complete problems
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- On approximation of max-vertex-cover
- Improved approximations for max set splitting and max NAE SAT
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- On the \(k\)-coloring of intervals
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximating Multiobjective Knapsack Problems
- On approximating multicriteria TSP
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Reducibility among Combinatorial Problems
- Non-monotone submodular maximization under matroid and knapsack constraints
- Multicriteria Optimization
- Paths, Trees, and Flowers
- Some optimal inapproximability results
- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
- Fundamentals of Computation Theory
- The dense \(k\)-subgraph problem
- On the complexity of a class of combinatorial optimization problems with uncertainty
- A Lagrangian relaxation approach to the edge-weighted clique problem
This page was built for publication: Approximation with a fixed number of solutions of some multiobjective maximization problems
