Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2016.03.031
@@ Property / DOI: 10.1016/j.ejor.2016.03.031 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 90C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 90C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6636414
@@ Property / zbMATH DE Number: 6636414 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traveling salesman
@@ Property / zbMATH Keywords: traveling salesman / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reformulation-linearization technique
@@ Property / zbMATH Keywords: reformulation-linearization technique / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+cycle cover
@@ Property / zbMATH Keywords: cycle cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+column generation
@@ Property / zbMATH Keywords: column generation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+lower bound
@@ Property / zbMATH Keywords: lower bound / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+AMPL
@@ Property / describes a project that uses: AMPL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LEMON
@@ Property / describes a project that uses: LEMON / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2308191028
@@ Property / OpenAlex ID: W2308191028 / rank @@
+Normal rank
@@ Property / cites work @@
+A level-2 reformulation-linearization technique bound for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Q4321548
@@ Property / cites work: Q4321548 / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+The Angular-Metric Traveling Salesman Problem
@@ Property / cites work: The Angular-Metric Traveling Salesman Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum reload cost paths, tours, and flows
@@ Property / cites work: On minimum reload cost paths, tours, and flows / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-Price: Column Generation for Solving Huge Integer Programs
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Stabilized column generation
@@ Property / cites work: Stabilized column generation / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope
+Normal rank
@@ Property / cites work @@
+Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
+Normal rank
@@ Property / cites work @@
+The symmetric quadratic traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On minimum reload cost cycle cover
@@ Property / cites work: On minimum reload cost cycle cover / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
+Normal rank
@@ Property / cites work @@
+Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+The traveling-salesman problem and minimum spanning trees: Part II
+Normal rank
@@ Property / cites work @@
+Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
+Normal rank
@@ Property / cites work @@
+Lagrangian duality applied to the vehicle routing problem with time windows
+Normal rank
@@ Property / cites work @@
+Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A descent method with linear programming subproblems for nondifferentiable convex optimization
+Normal rank
@@ Property / cites work @@
+The B<scp>oxstep</scp> Method for Large-Scale Optimization
+Normal rank
@@ Property / cites work @@
+Integer Programming Formulation of Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+The Boolean quadratic polytope: Some characteristics, facets and relatives
+Normal rank
@@ Property / cites work @@
+An analytical comparison of different formulations of the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+A revised reformulation-linearization technique for the quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
+Normal rank
@@ Property / cites work @@
+On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2016.03.031
@@ Property / DOI: 10.1016/J.EJOR.2016.03.031 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:323214