On matroids with multiple objectives
From MaRDI portal
Recommendations
Cites work
- Comments on bases in dependence structures
- On spanning tree problems with multiple objectives
- Proper efficiency and the theory of vector maximization
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The matroidal knapsack: A class of (often) well-solvable problems
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
Cited in
(18)- A new exchange property for matroids and its application to max-min-problems
- Computation in multicriteria matroid optimization
- Connectedness of efficient solutions in multiple criteria combinatorial optimization
- Multi-objective matroid optimization with ordinal weights
- Approximate tradeoffs on weighted labeled matroids
- Matroid optimisation problems with nested non-linear monomials in the objective function
- Optimal matroid partitioning problems
- Optimization problems with uncertain objective coefficients using capacities
- Optimal matroid partitioning problems
- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization
- Persistency in combinatorial optimization problems on matroids
- A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization
- Biobjective optimization problems on matroids with binary costs
- Paroids: A canonical format for combinatorial optimization
- Matroid optimization with the interleaving of two ordered sets
- Maximizing Classes of Two-Parameter Objectives Over Matroids
- Efficient solution of the matroid product problem
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
This page was built for publication: On matroids with multiple objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2785392)
