A semidefinite optimization approach to the target visitation problem
DOI10.1007/S11590-014-0824-9zbMATH Open1333.90151OpenAlexW2004598396MaRDI QIDQ895779FDOQ895779
Authors: Philipp Hungerländer 
Publication date: 4 December 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0824-9
Recommendations
combinatorial optimizationinterior point methodssemidefinite programmingtraveling salesman problemrelaxationbundle methodslinear ordering problemtarget visitation problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Semidefinite programming (90C22) Boolean programming (90C09) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 benchmark library and a comparison of heuristic methods for the linear ordering problem
- A computational study and survey of methods for the single-row facility layout problem
- A random keys based genetic algorithm for the target visitation problem
- A survey for the quadratic assignment problem
- An Interior-Point Method for Semidefinite Programming
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Assignment Problems and the Location of Economic Activities
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Cooperative control and optimization
- Geometry of cuts and metrics
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Improved analysis of an algorithm for the coupled task problem with UET jobs
- Induced binary probabilities and the linear ordering polytope: A status report
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Optimal Weighted Ancestry Relationships
- Semidefinite relaxations of ordering problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some simplified NP-complete graph problems
- The linear ordering problem with cumulative costs
- 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
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited In (6)
- The target visitation arc routing problem
- The target visitation problem
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
- A branch-and-cut algorithm for the target visitation problem
- Title not available (Why is that?)
- A linear ordering problem with weighted rank
Uses Software
This page was built for publication: A semidefinite optimization approach to the target visitation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895779)
