A strong flow-based formulation for the shortest path problem in digraphs with negative cycles (Q3184586): Difference between revisions

@@ Property / describes a project that uses @@
+GLPK
@@ Property / describes a project that uses: GLPK / 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.1111/j.1475-3995.2008.00681.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2020990638
@@ Property / OpenAlex ID: W2020990638 / rank @@
+Normal rank
@@ Property / cites work @@
+A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / 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 @@
+Q4928164
@@ Property / cites work: Q4928164 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the shortest Hamiltonean path in directed graphs
+Normal rank