A branch-and-cut algorithm for factory crane scheduling problem (Q897052): Difference between revisions

@@ Property / cites work @@
+The precedence-constrained asymmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+Crane scheduling with spatial constraints
@@ Property / cites work: Crane scheduling with spatial constraints / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
+Normal rank
@@ Property / cites work @@
+Crane scheduling in container yards with inter-crane interference
+Normal rank
@@ Property / cites work @@
+Q2753185
@@ Property / cites work: Q2753185 / rank @@
+Normal rank
@@ Property / cites work @@
+The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
+Normal rank
@@ Property / cites work @@
+Q3036721
@@ Property / cites work: Q3036721 / rank @@
+Normal rank