The base-matroid and inverse combinatorial optimization problems.

DOI10.1016/S0166-218X(02)00498-5MaRDI QIDQ1811117zbMATH OpenOpenAlexWikidataFDO

Authors 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, http://hdl.handle.net/11380/451194

zbMATH Keywords

matroid optimization problem

Mathematics Subject Classification ID

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

Recommendations

• Inverse problems of matroid intersection
• Inverse matroid intersection problem
• scientific article; zbMATH DE number 62768
• Inverse matroid optimization problem under the weighted Hamming distances
• scientific article; zbMATH DE number 4066909

Cites work

• A strongly polynomial algorithm for the inverse shortest arborescence problem
• A weighted matroid intersection algorithm
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• Inverse matroid intersection problem
• Inverse Optimization
• Inverse polymatroidal flow problem
• Inverse problems of matroid intersection
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On an instance of the inverse shortest paths problem
• On submodular function minimization
• Solving inverse spanning tree problems through network flow techniques
• Transversals and matroid partition

Cited in

(13)

• Inverse matroid intersection problem
• Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
• Inverse problems of matroid intersection
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• On some properties of base-matroids
• 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
• A particular class of graphic matroids
• Fully Optimal Bases and the Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids
• Inverse matroid optimization problem under the weighted Hamming distances
• Some properties of base-matroids of arbitrary cardinality

This page was built for publication: The base-matroid and inverse combinatorial optimization problems.

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