A new exchange property for matroids and its application to max-min-problems

DOI10.1007/BF01919086zbMath0549.90084OpenAlexW1971000892MaRDI QIDQ3342227

Daniel Granot

Publication date: 1984

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01919086

zbMATH Keywords

algorithmsensitivity analysisLagrangean relaxationmatroidindependence systemknapsack constraintmaxmin optimizationmaxmin spanning tree

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Existence of solutions for minimax problems (49J35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A note on \(K\) best network flows ⋮ Note on combinatorial optimization with max-linear objective functions

Cites Work

• Unnamed Item
• Algorithmic versus axiomatic definitions of matroids
• A Survey of Lagrangean Techniques for Discrete Optimization
• Matroids and the greedy algorithm