Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Matroid optimization with generalized constraints

From MaRDI portal
Publication:1902899
Jump to:navigation, search

DOI10.1016/0166-218X(94)00031-8zbMath0837.90104MaRDI QIDQ1902899

Mandayam A. Srinivas

Publication date: 3 December 1995

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


zbMATH Keywords

constrained optimizationconvexitymatroid intersectionrecognition problemspartition matroid


Mathematics Subject Classification ID

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


Related Items (1)

Biobjective optimization problems on matroids with binary costs



Cites Work

  • Matroid optimization with the interleaving of two ordered sets
  • A multiply constrained matroid optimization problem
  • Efficient algorithms for a family of matroid intersection problems
  • Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
  • Fibonacci heaps and their uses in improved network optimization algorithms
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Matroid optimization with generalized constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1902899&oldid=14316171"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki