scientific article

From MaRDI portal

Revision as of 05:01, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4070624

Jump to:navigation, search

zbMath0312.90037MaRDI QIDQ4070624

Jack Edmonds

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (9)

Reachability in arborescence packings ⋮ Packing of arborescences with matroid constraints via matroid intersection ⋮ FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs ⋮ Immersing complete digraphs ⋮ Discrete extremal problems ⋮ Edge-disjoint branchings in temporal digraphs ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection ⋮ Integer programming duality: Price functions and sensitivity analysis ⋮ Equivalence between the minimum covering problem and the maximum matching problem

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4070624&oldid=17812650"