Strong linear programming relaxations for the orienteering problem (Q1328645): Difference between revisions

@@ Property / describes a project that uses @@
+VRP
@@ Property / describes a project that uses: VRP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4205235
@@ Property / cites work: Q4205235 / rank @@
+Normal rank
@@ Property / cites work @@
+A Modeling Language for Mathematical Programming
@@ Property / cites work: A Modeling Language for Mathematical Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3792511
@@ Property / cites work: Q3792511 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795496
@@ Property / cites work: Q3795496 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All the Elementary Circuits of a Directed Graph
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Algorithms to solve the orienteering problem: A comparison
+Normal rank
@@ Property / cites work @@
+The selective travelling salesman problem
@@ Property / cites work: The selective travelling salesman problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1328645