New approaches to multi-objective optimization

DOI10.1007/s10107-013-0703-7zbMath1297.90147OpenAlexW2083246371MaRDI QIDQ403670

R. Ravi, Rico Zenklusen, Mohit Singh, Fabrizio Grandoni

Publication date: 29 August 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0703-7

zbMATH Keywords

multi-objective optimizationcombinatorial optimizationapproximation algorithmsmulti-budgeted optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (27)

Approximation-Friendly Discrepancy Rounding ⋮ On Double-Resolution Imaging and Discrete Tomography ⋮ Approximation algorithms for clustering with dynamic points ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ On the minimum \(s-t\) cut problem with budget constraints ⋮ Biobjective optimization problems on matroids with binary costs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Ranking with Fairness Constraints ⋮ The capacitated orienteering problem ⋮ Tour recommendation for groups ⋮ Multi-criteria approximation schemes for the resource constrained shortest path problem ⋮ Bi-objective matchings with the triangle inequality ⋮ Connectivity interdiction ⋮ Approximate Pareto sets of minimal size for multi-objective optimization problems ⋮ One-exact approximate Pareto sets ⋮ Bulk-robust combinatorial optimization ⋮ Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Generalized Center Problems with Outliers ⋮ Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects ⋮ Socially fair network design via iterative rounding ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• A factor 2 approximation algorithm for the generalized Steiner network problem
• Testing membership in matroid polyhedra
• Sets on which several measures agree
• Exact arborescences, matchings and cycles
• Matching is as easy as matrix inversion
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Cutting the same fraction of several measures
• Splitting multidimensional necklaces
• Generalized sandwich theorems
• An improved LP-based approximation for steiner tree
• Monotone Covering Problems with an Additional Covering Constraint
• Matching Based Augmentations for Approximating Connectivity Problems
• Survivable network design with degree or order constraints
• Approximating minimum bounded degree spanning trees to within one of optimal
• Approximation Schemes for Multi-Budgeted Independence Systems
• Iterative Rounding for Multi-Objective Optimization Problems
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Random pseudo-polynomial algorithms for exact matroid problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Bicriteria Network Design Problems
• An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
• Drei Sätze über die n-dimensionale euklidische Sphäre
• The constrained minimum spanning tree problem
• Many birds with one stone
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Matroids and integrality gaps for hypergraphic steiner tree relaxations
• Combinatorial optimization. Theory and algorithms.
• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: New approaches to multi-objective optimization