A novel MILP model for \(N\)-vehicle exploration problem (Q2240108): Difference between revisions

@@ Property / cites work @@
+The Jeep Problem
@@ Property / cites work: The Jeep Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The one-machine sequencing problem
@@ Property / cites work: The one-machine sequencing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Real-Time Algorithm Scheme for n-Vehicle Exploration Problem
+Normal rank
@@ Property / cites work @@
+Multitask \(n\)-vehicle exploration problem: complexity and algorithm
+Normal rank
@@ Property / cites work @@
+Q3054107
@@ Property / cites work: Q3054107 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2924359
@@ Property / cites work: Q2924359 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the airplane refueling problem
+Normal rank
@@ Property / cites work @@
+A linear mixed integer programming model for \(N\)-vehicle exploration problem
+Normal rank
@@ Property / cites work @@
+For the airplane refueling problem local precedence implies global precedence
+Normal rank
@@ Property / cites work @@
+The local-global conjecture for scheduling with non-linear cost
+Normal rank