The ellipsoid method and its consequences in combinatorial optimization (Q1168215): Difference between revisions

@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching, Euler tours and the Chinese postman
@@ Property / cites work: Matching, Euler tours and the Chinese postman / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+On the orientation of graphs
@@ Property / cites work: On the orientation of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859792
@@ Property / cites work: Q3859792 / 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 @@
+Q5572841
@@ Property / cites work: Q5572841 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+Khachiyan’s algorithm for linear programming
@@ Property / cites work: Khachiyan’s algorithm for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Multi-Commodity Network Flows
@@ Property / cites work: Multi-Commodity Network Flows / rank @@
+Normal rank
@@ Property / cites work @@
+Two-commodity cut-packing problem
@@ Property / cites work: Two-commodity cut-packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+-Matchings and 2-covers of hypergraphs
@@ Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3934404
@@ Property / cites work: Q3934404 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / 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 @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity flows in planar graphs
@@ Property / cites work: Multicommodity flows in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+The matroids with the max-flow min-cut property
@@ Property / cites work: The matroids with the max-flow min-cut property / rank @@
+Normal rank
@@ Property / cites work @@
+A two-commodity cut theorem
@@ Property / cites work: A two-commodity cut theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence rate of the gradient descent method with dilatation of the space
+Normal rank