New approaches to multi-objective optimization
From MaRDI portal
Publication:403670
DOI10.1007/S10107-013-0703-7zbMATH Open1297.90147OpenAlexW2083246371MaRDI QIDQ403670FDOQ403670
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
Recommendations
- Recent advances in multiobjective optimization
- Recent developments in multiple objective optimization
- A new approach to a multicriteria optimization problem
- A new evolutionary approach for multiobjective optimization
- Multiobjective programming with new invexities
- scientific article; zbMATH DE number 680238
- A systematic approach to multiobjective optimization
- The new multi-objective optimization approach for performance evaluation problems
- Methods for multi-objective optimization: an analysis
- Multiobjective optimization problems
combinatorial optimizationapproximation algorithmsmulti-objective optimizationmulti-budgeted optimization
Cites Work
- Title not available (Why is that?)
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Bicriteria Network Design Problems
- The constrained minimum spanning tree problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- Combinatorial optimization. Theory and algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved LP-based approximation for Steiner tree
- Matching is as easy as matrix inversion
- Approximation Schemes for Multi-Budgeted Independence Systems
- Title not available (Why is that?)
- Testing membership in matroid polyhedra
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Iterative Rounding for Multi-Objective Optimization Problems
- Matroids and integrality gaps for hypergraphic steiner tree relaxations
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Approximating minimum bounded degree spanning trees to within one of optimal
- Title not available (Why is that?)
- Many birds with one stone
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Sets on which several measures agree
- Exact arborescences, matchings and cycles
- Cutting the same fraction of several measures
- Splitting multidimensional necklaces
- Generalized sandwich theorems
- Monotone Covering Problems with an Additional Covering Constraint
- Matching Based Augmentations for Approximating Connectivity Problems
- Survivable network design with degree or order constraints
- Title not available (Why is that?)
- Random pseudo-polynomial algorithms for exact matroid problems
- Title not available (Why is that?)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
Cited In (36)
- Optimal Network Design with End-to-End Service Requirements
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Tour recommendation for groups
- Ranking with Fairness Constraints
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Title not available (Why is that?)
- Approximate multi-matroid intersection via iterative refinement
- Iterative Rounding for Multi-Objective Optimization Problems
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Bulk-robust combinatorial optimization
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Approximation algorithms for clustering with dynamic points
- Connectivity interdiction
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Recent advances in multiobjective optimization
- One-exact approximate Pareto sets
- Methods for multi-objective optimization: an analysis
- Multiobjective programming with new invexities
- A theory and algorithms for combinatorial reoptimization
- Evolutionary Multi-Criterion Optimization
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
- Generalized Center Problems with Outliers
- Biobjective optimization problems on matroids with binary costs
- The capacitated orienteering problem
- Approximating the shortest path problem with scenarios
- On Double-Resolution Imaging and Discrete Tomography
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems
- Socially fair network design via iterative rounding
- Bi-objective matchings with the triangle inequality
- On the minimum \(s-t\) cut problem with budget constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation-Friendly Discrepancy Rounding
This page was built for publication: New approaches to multi-objective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403670)
