Fractional packing in ideal clutters (Q431029): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-010-0410-6
@@ Property / DOI: 10.1007/s10107-010-0410-6 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6050456
@@ Property / zbMATH DE Number: 6050456 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+packing
@@ Property / zbMATH Keywords: packing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+ideal clutter
@@ Property / zbMATH Keywords: ideal clutter / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dijoin
@@ Property / zbMATH Keywords: dijoin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-010-0410-6
+Normal rank
@@ Property / OpenAlex ID @@
+W3138290550
@@ Property / OpenAlex ID: W3138290550 / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional Packing of<i>T</i>-Joins
@@ Property / cites work: Fractional Packing of<i>T</i>-Joins / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization
@@ Property / cites work: Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Bottleneck extrema
@@ Property / cites work: Bottleneck extrema / rank @@
+Normal rank
@@ Property / cites work @@
+How to make a digraph strongly connected
@@ Property / cites work: How to make a digraph strongly connected / rank @@
+Normal rank
@@ Property / cites work @@
+Blocking and anti-blocking pairs of polyhedra
@@ Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Centroids, Representations, and Submodular Flows
@@ Property / cites work: Centroids, Representations, and Submodular Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Packing algorithms for arborescences (and spanning trees) in capacitated graphs
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+An algorithm for minimum cost arc-connectivity orientations
+Normal rank
@@ Property / cites work @@
+On the width—length inequality
@@ Property / cites work: On the width—length inequality / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem for Directed Graphs
@@ Property / cites work: A Minimax Theorem for Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A counterexample to a conjecture of Edmonds and Giles
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / DOI @@
+.1007/S10107-010-0410-6
@@ Property / DOI: 10.1007/S10107-010-0410-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:431029