Bike sharing systems: solving the static rebalancing problem (Q2445841): Difference between revisions

@@ Property / DOI @@
-.1016/j.disopt.2012.11.005
@@ Property / DOI: 10.1016/j.disopt.2012.11.005 / rank @@
-Normal rank
@@ Property / author @@
-Roberto Wolfler Calvo
@@ Property / author: Roberto Wolfler Calvo / rank @@
-Normal rank
@@ Property / author @@
+Roberto Wolfler Calvo
@@ Property / author: Roberto Wolfler Calvo / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Tabu search
@@ Property / describes a project that uses: Tabu search / 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.1016/j.disopt.2012.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2054274567
@@ Property / OpenAlex ID: W2054274567 / rank @@
+Normal rank
@@ Property / cites work @@
+Bike sharing systems: solving the static rebalancing problem
+Normal rank
@@ Property / cites work @@
+Balancing the stations of a self service “bike hire” system
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
+Normal rank
@@ Property / cites work @@
+The swapping problem
@@ Property / cites work: The swapping problem / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the preemptive swapping problem
+Normal rank
@@ Property / cites work @@
+A branch‐and‐cut algorithm for the nonpreemptive swapping problem
+Normal rank
@@ Property / cites work @@
+The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
+Normal rank
@@ Property / cites work @@
+A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
+Normal rank
@@ Property / cites work @@
+Separating capacity constraints in the CVRP using tabu search
+Normal rank
@@ Property / cites work @@
+Q4414640
@@ Property / cites work: Q4414640 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286075
@@ Property / cites work: Q3286075 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Branching rules revisited
@@ Property / cites work: Branching rules revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tabu Search Heuristic for the Vehicle Routing Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.DISOPT.2012.11.005
@@ Property / DOI: 10.1016/J.DISOPT.2012.11.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2445841