The base-matroid and inverse combinatorial optimization problems.
type: Item
instance of: scholarly article
title: The base-matroid and inverse combinatorial optimization problems.
zbMATH Open document ID: 1039.05020
DOI: 10.1016/S0166-218X(02)00498-5
author: Mauro Dell'Amico
author: Francesco Maffioli
author: Federico Malucelli
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1925292
zbMATH Keywords: matroid optimization problem
Wikidata QID: Q59222289
MaRDI profile type: Publication
cites work: Inverse Optimization
cites work: Solving inverse spanning tree problems through network flow techniques
cites work: On an instance of the inverse shortest paths problem
cites work: Inverse problems of matroid intersection
cites work: Inverse matroid intersection problem
cites work: Inverse polymatroidal flow problem
cites work: On submodular function minimization
cites work: Transversals and matroid partition
cites work: A weighted matroid intersection algorithm
cites work: A strongly polynomial algorithm for the inverse shortest arborescence problem
cites work: Q4130999
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3135082
full work available at URL: s0166-218x(02)00498-5
OpenAlex ID: W1975978423
description: scientific article; zbMATH DE number 1925292