Model-based automatic neighborhood design by unsupervised learning (Q337347): Difference between revisions

@@ Property / cites work @@
+New convergent heuristics for 0-1 mixed integer programming
+Normal rank
@@ Property / cites work @@
+Local branching
@@ Property / cites work: Local branching / rank @@
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search and local branching
@@ Property / cites work: Variable neighborhood search and local branching / rank @@
+Normal rank
@@ Property / cites work @@
+Repairing MIP infeasibility through local branching
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
+Normal rank
@@ Property / cites work @@
+Bounding, filtering and diversification in CP-based local branching
+Normal rank
@@ Property / cites work @@
+Exploring relaxation induced neighborhoods to improve MIP solutions
+Normal rank
@@ Property / cites work @@
+A survey of very large-scale neighborhood search techniques
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+The Vehicle Routing Problem
@@ Property / cites work: The Vehicle Routing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
+Normal rank
@@ Property / cites work @@
+GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
+Normal rank
@@ Property / cites work @@
+A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
+Normal rank