EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Matroid intersection"
Narrow search

Narrow search

Year of publication
Subject
All
Matroid intersection 4 Mathematical programming 3 Mathematische Optimierung 3 Theorie 3 Theory 3 Inverse matroid intersection problem 2 Matroid 2 matching 2 matroid intersection 2 minimum cost circulation 2 strongly polynomial algorithm 2 Approximation 1 Generalized polymatroid 1 Independence system 1 Matroid coloring 1 Matroid decomposition 1 Nonseparable discrete convex function 1 Persistency partition 1 Polynomial algorithm 1 Set cover 1
more ... less ...
Online availability
All
Undetermined 8
Type of publication
All
Article 8
Type of publication (narrower categories)
All
Article in journal 3 Aufsatz in Zeitschrift 3
Language
All
Undetermined 5 English 3
Author
All
Fekete, Sándor P. 2 Firla, Robert T. 2 Li, Yanjun 2 Mao-Cheng, Cai 2 Moseley, Benjamin 2 Pruhs, Kirk 2 Spille, Bianca 2 Im, Sungjin 1 Leichter, Marilena 1 Magos, D. 1 Mourtos, I. 1 Pitsoulis, L. 1 Takazawa, Kenjiro 1
more ... less ...
Published in...
All
Operations research letters 3 Computational Statistics 2 Mathematical Methods of Operations Research 2 Computational Management Science 1
Source
All
RePEc 5 ECONIS (ZBW) 3
Showing 1 - 8 of 8
Cover Image
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
Takazawa, Kenjiro - In: Operations research letters 51 (2023) 2, pp. 128-132
Persistent link: https://www.econbiz.de/10014311833
Saved in:
Cover Image
On the impossibility of decomposing binary matroids
Leichter, Marilena; Moseley, Benjamin; Pruhs, Kirk - In: Operations research letters 50 (2022) 5, pp. 623-625
Persistent link: https://www.econbiz.de/10013449457
Saved in:
Cover Image
The matroid intersection cover problem
Im, Sungjin; Moseley, Benjamin; Pruhs, Kirk - In: Operations research letters 49 (2021) 1, pp. 17-22
Persistent link: https://www.econbiz.de/10012485734
Saved in:
Cover Image
Persistency and matroid intersection
Magos, D.; Mourtos, I.; Pitsoulis, L. - In: Computational Management Science 6 (2009) 4, pp. 435-445
Persistent link: https://www.econbiz.de/10005014973
Saved in:
Cover Image
Characterizing matchings as the intersection of matroids
Fekete, Sándor P.; Firla, Robert T.; Spille, Bianca - In: Mathematical Methods of Operations Research 58 (2003) 2, pp. 319-329
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the...
Persistent link: https://www.econbiz.de/10010999794
Saved in:
Cover Image
Characterizing matchings as the intersection of matroids
Fekete, Sándor P.; Firla, Robert T.; Spille, Bianca - In: Computational Statistics 58 (2003) 2, pp. 319-329
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the...
Persistent link: https://www.econbiz.de/10010759390
Saved in:
Cover Image
Inverse Matroid Intersection Problem
Mao-Cheng, Cai; Li, Yanjun - In: Mathematical Methods of Operations Research 45 (1997) 2, pp. 235-243
, andw a weight function onS. Given two functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to …
Persistent link: https://www.econbiz.de/10010999857
Saved in:
Cover Image
Inverse Matroid Intersection Problem
Mao-Cheng, Cai; Li, Yanjun - In: Computational Statistics 45 (1997) 2, pp. 235-243
functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight functionw′ such …
Persistent link: https://www.econbiz.de/10010759448
Saved in:
A service of the
zbw
FAQ-Assistent (beta)
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...