Pages that link to "Item:Q1811117"
From MaRDI portal
The following pages link to The base-matroid and inverse combinatorial optimization problems. (Q1811117):
Displaying 9 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- Some properties of base-matroids of arbitrary cardinality (Q968589) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
- On some properties of base-matroids (Q2492217) (← links)
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
- A particular class of graphic matroids (Q3439157) (← links)
