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

DOI10.1007/BF01919086zbMATH Open0549.90084OpenAlexW1971000892MaRDI QIDQ3342227FDOQ3342227

Authors: 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

Recommendations

• On matroids with multiple objectives
• Matroid optimization with the interleaving of two ordered sets
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• scientific article; zbMATH DE number 140090
• scientific article; zbMATH DE number 1303581

zbMATH Keywords

sensitivity analysisalgorithmmatroidknapsack constraintLagrangean relaxationindependence systemmaxmin optimizationmaxmin spanning tree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Matroids and the greedy algorithm
• A Survey of Lagrangean Techniques for Discrete Optimization
• Algorithmic versus axiomatic definitions of matroids

Cited In (22)

• Optimization theory on antichains with the Steinitz exchange property
• Tropical Kirchhoff's formula and postoptimality in matroid optimization
• The optimal base of a matroid with three-type constraints
• On a discrete optimization problem
• Note on combinatorial optimization with max-linear objective functions
• Title not available (Why is that?)
• A short proof of a min-max relation for the bases packing of a matroid
• Persistency in combinatorial optimization problems on matroids
• A matroid view of key theorems for edge-swapping algorithms
• Title not available (Why is that?)
• Matroids on convex geometries: subclasses, operations, and optimization
• Title not available (Why is that?)
• The convex weighting of a graph and an alternative definition of a matroid
• A note on \(K\) best network flows
• Maximizing Classes of Two-Parameter Objectives Over Matroids
• Matroid optimization with the interleaving of two ordered sets
• k-sum optimization problems
• An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

This page was built for publication: A new exchange property for matroids and its application to max-min-problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342227)