New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
From MaRDI portal
Publication:729796
Recommendations
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- scientific article; zbMATH DE number 1873286
- SDP relaxations for some combinatorial optimization problems
- Solving a semidefinite relaxation of the traveling salesman problem.
Cites work
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A complete description of the traveling salesman polytope on 8 nodes
- A computational study and survey of methods for the single-row facility layout problem
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A semidefinite optimization approach to the target visitation problem
- A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- Approximate graph coloring by semidefinite programming
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exact algorithms for the quadratic linear ordering problem
- Fixing Variables in Semidefinite Relaxations
- Geometry of cuts and metrics
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Handbook on semidefinite, conic and polynomial optimization
- Heuristic analysis, linear programming and branch and bound
- scientific article; zbMATH DE number 3850790 (Why is no real title available?)
- scientific article; zbMATH DE number 1342125 (Why is no real title available?)
- scientific article; zbMATH DE number 1534298 (Why is no real title available?)
- scientific article; zbMATH DE number 1757965 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved inapproximability for TSP
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Induced binary probabilities and the linear ordering polytope: A status report
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On the approximability of the traveling salesman problem
- On the power of unique 2-prover 1-round games
- Optimal Weighted Ancestry Relationships
- Reducibility among combinatorial problems
- Semidefinite relaxations of ordering problems
- Solution of a Large-Scale Traveling-Salesman Problem
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The traveling salesman problem and its variations
- The traveling salesman problem. A computational study.
- The traveling salesman. Computational solutions for RSP applications
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(4)- Block-insertion-based algorithms for the linear ordering problem
- The unbounded integrality gap of a semidefinite relaxation of the traveling salesman problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- A semidefinite optimization approach to the target visitation problem
This page was built for publication: New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q729796)
