A strong cutting plane algorithm for the robotic assembly line balancing problem (Q4399053): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207549508904817
+Normal rank
@@ Property / OpenAlex ID @@
+W1983533679
@@ Property / OpenAlex ID: W1983533679 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
+Normal rank
@@ Property / cites work @@
+Assembly-Line Balancing by Linear Programming
@@ Property / cites work: Assembly-Line Balancing by Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Zero-One Linear Programming Problems
+Normal rank
@@ Property / cites work @@
+A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4399053