The base-matroid and inverse combinatorial optimization problems.

DOI10.1016/S0166-218X(02)00498-5zbMath1039.05020OpenAlexW1975978423WikidataQ59222289 ScholiaQ59222289MaRDI QIDQ1811117

Mauro Dell'Amico, Francesco Maffioli, Federico Malucelli

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00498-5

zbMATH Keywords

matroid optimization problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Algorithm for constraint partial inverse matroid problem with weight increase forbidden, Algorithms for the partial inverse matroid problem in which weights can only be increased, Approximation algorithms for capacitated partial inverse maximum spanning tree problem, Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm, The partial inverse minimum spanning tree problem when weight increase is forbidden, Some properties of base-matroids of arbitrary cardinality, On some properties of base-matroids, Capacitated partial inverse maximum spanning tree under the weighted Hamming distance, A particular class of graphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• On submodular function minimization
• On an instance of the inverse shortest paths problem
• Inverse polymatroidal flow problem
• Inverse matroid intersection problem
• A strongly polynomial algorithm for the inverse shortest arborescence problem
• Inverse problems of matroid intersection
• Solving Inverse Spanning Tree Problems Through Network Flow Techniques
• Inverse Optimization
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A weighted matroid intersection algorithm
• Transversals and matroid partition