On the acyclic subgraph polytope (Q3698818): Difference between revisions

@@ Property / author @@
-Gerhard Reinelt
@@ Property / author: Gerhard Reinelt / rank @@
-Normal rank
@@ Property / author @@
+Gerhard Reinelt
@@ Property / author: Gerhard Reinelt / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q29042437
@@ Property / Wikidata QID: Q29042437 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the linear ordering polytope
@@ Property / cites work: Facets of the linear ordering polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A Cutting Plane Algorithm for the Linear Ordering Problem
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the acyclic subgraph problem
+Normal rank
@@ Property / cites work @@
+A Minimax Theorem for Directed Graphs
@@ Property / cites work: A Minimax Theorem for Directed Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01582009
+Normal rank
@@ Property / OpenAlex ID @@
+W2042649619
@@ Property / OpenAlex ID: W2042649619 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3698818