A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103): Difference between revisions

@@ Property / DOI @@
-.1002/net.20307
@@ Property / DOI: 10.1002/net.20307 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SCIP
@@ Property / describes a project that uses: SCIP / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.20307
@@ Property / full work available at URL: https://doi.org/10.1002/net.20307 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4250280589
@@ Property / OpenAlex ID: W4250280589 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching rules revisited
@@ Property / cites work: Branching rules revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem: II. Polyhedral results
+Normal rank
@@ Property / cites work @@
+Facets of the Knapsack Polytope From Minimal Covers
+Normal rank
@@ Property / cites work @@
+Solving the Orienteering Problem through Branch-and-Cut
+Normal rank
@@ Property / cites work @@
+New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4540081
@@ Property / cites work: Q4540081 / rank @@
+Normal rank
@@ Property / cites work @@
+On the symmetric travelling salesman problem II: Lifting theorems and facets
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
+Normal rank
@@ Property / cites work @@
+The selective travelling salesman problem
@@ Property / cites work: The selective travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Strong linear programming relaxations for the orienteering problem
+Normal rank
@@ Property / cites work @@
+An upper bound for the zero-one knapsack problem and a branch and bound algorithm
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Facet identification for the symmetric traveling salesman polytope
+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 @@
+On the \(0/1\) knapsack polytope
@@ Property / cites work: On the \(0/1\) knapsack polytope / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/NET.20307
@@ Property / DOI: 10.1002/NET.20307 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3057103