On matroids with multiple objectives
From MaRDI portal
Publication:2785392
DOI10.1080/02331939608844238zbMath0868.90098OpenAlexW2011023380MaRDI QIDQ2785392
Publication date: 26 August 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/4850
Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ Multi-objective matroid optimization with ordinal weights ⋮ Biobjective optimization problems on matroids with binary costs ⋮ A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization ⋮ A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization ⋮ Connectedness of efficient solutions in multiple criteria combinatorial optimization ⋮ Approximate tradeoffs on weighted labeled matroids
Cites Work
- The matroidal knapsack: A class of (often) well-solvable problems
- On spanning tree problems with multiple objectives
- Proper efficiency and the theory of vector maximization
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- Comments on bases in dependence structures