Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174): Difference between revisions

@@ Property / cites work @@
+Combinatorial optimization models for production scheduling in automated manufacturing systems
+Normal rank
@@ Property / cites work @@
+The General Pickup and Delivery Problem
@@ Property / cites work: The General Pickup and Delivery Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The single vehicle routing problem with deliveries and selective pickups
+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 solving the Non-preemptive Capacitated Swapping Problem
+Normal rank
@@ Property / cites work @@
+A survey of scheduling problems with setup times or costs
+Normal rank
@@ Property / cites work @@
+Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
+Normal rank
@@ Property / cites work @@
+The unit-capacity constrained permutation problem
@@ Property / cites work: The unit-capacity constrained permutation problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank