Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545): Difference between revisions

@@ Property / author @@
+Greet vanden Berghe
@@ Property / author: Greet vanden Berghe / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1793246991
@@ Property / OpenAlex ID: W1793246991 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
+Normal rank
@@ Property / cites work @@
+An Automatic Method of Solving Discrete Programming Problems
+Normal rank
@@ Property / cites work @@
+Algorithms for the Assignment and Transportation Problems
+Normal rank
@@ Property / cites work @@
+Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
+Normal rank
@@ Property / cites work @@
+Benders' cuts guided large neighborhood search for the traveling umpire problem
+Normal rank
@@ Property / cites work @@
+Decomposition and local search based methods for the traveling umpire problem
+Normal rank
@@ Property / cites work @@
+Two exact algorithms for the traveling umpire problem
+Normal rank