Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-87477-5_31
+Normal rank
@@ Property / OpenAlex ID @@
+W1488000730
@@ Property / OpenAlex ID: W1488000730 / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multiobjective routing problems
@@ Property / cites work: Multiobjective routing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Network flow models for the local access network expansion problem
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+The selective travelling salesman problem
@@ Property / cites work: The selective travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Routing problems: A bibliography
@@ Property / cites work: Routing problems: A bibliography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845371
@@ Property / cites work: Q4845371 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank