New approaches to multi-objective optimization
From MaRDI portal
(Redirected from Publication:403670)
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
Cites work
- scientific article; zbMATH DE number 15085 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 5485590 (Why is no real title available?)
- scientific article; zbMATH DE number 5485591 (Why is no real title available?)
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- A simple efficient approximation scheme for the restricted shortest path problem
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- An improved LP-based approximation for Steiner tree
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximation Schemes for Multi-Budgeted Independence Systems
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms.
- Cutting the same fraction of several measures
- Drei Sätze über die n-dimensionale euklidische Sphäre
- Exact arborescences, matchings and cycles
- Generalized sandwich theorems
- Iterative Rounding for Multi-Objective Optimization Problems
- Many birds with one stone
- Matching Based Augmentations for Approximating Connectivity Problems
- Matching is as easy as matrix inversion
- Matroidal degree-bounded minimum spanning trees
- Matroids and integrality gaps for hypergraphic Steiner tree relaxations
- Monotone covering problems with an additional covering constraint
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Random pseudo-polynomial algorithms for exact matroid problems
- Sets on which several measures agree
- Splitting multidimensional necklaces
- Survivable network design with degree or order constraints
- Testing membership in matroid polyhedra
- The constrained minimum spanning tree problem
Cited in
(40)- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Structural iterative rounding for generalized k-median problems
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Generalized center problems with outliers
- Tour recommendation for groups
- Ranking with Fairness Constraints
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Approximate multi-matroid intersection via iterative refinement
- Multi-budgeted matching problems
- Iterative Rounding for Multi-Objective Optimization Problems
- On double-resolution imaging and discrete tomography
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- Bulk-robust combinatorial optimization
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Generalized Nash fairness solutions for bi-objective discrete optimization: theory and algorithms
- Connectivity interdiction
- Approximation algorithms for clustering with dynamic points
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Approximation algorithms for clustering with dynamic points
- Recent advances in multiobjective optimization
- One-exact approximate Pareto sets
- Structural iterative rounding for generalized \(k\)-median problems
- Methods for multi-objective optimization: an analysis
- Multiobjective programming with new invexities
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Generalized center problems with outliers
- A theory and algorithms for combinatorial reoptimization
- Optimal network design with end-to-end service requirements
- Evolutionary Multi-Criterion Optimization
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
- The capacitated orienteering problem
- Biobjective optimization problems on matroids with binary costs
- Approximating the shortest path problem with scenarios
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Socially fair network design via iterative rounding
- Bi-objective matchings with the triangle inequality
- On the minimum \(s-t\) cut problem with budget constraints
- scientific article; zbMATH DE number 1555941 (Why is no real title available?)
- scientific article; zbMATH DE number 1149851 (Why is no real title available?)
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)
