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

• The target visitation problem
• A branch-and-cut algorithm for the target visitation problem
• Route optimization for multiple searchers
• The target visitation arc routing problem
• The moving-target traveling salesman problem

zbMATH Keywords

combinatorial optimizationinterior point methodssemidefinite programmingtraveling salesman problemrelaxationbundle methodslinear ordering problemtarget visitation problem

Mathematics Subject Classification ID

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

• The traveling salesman problem. A computational study.
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Title not available (Why is that?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The traveling salesman problem and its variations
• Assignment Problems and the Location of Economic Activities
• Cones of Matrices and Set-Functions and 0–1 Optimization
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Geometry of cuts and metrics
• Some simplified NP-complete graph problems
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A survey for the quadratic assignment problem
• Induced binary probabilities and the linear ordering polytope: A status report
• The traveling salesman. Computational solutions for RSP applications
• Cooperative control and optimization
• A computational study and survey of methods for the single-row facility layout problem
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Semidefinite relaxations of ordering problems
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Title not available (Why is that?)
• Optimal Weighted Ancestry Relationships
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Title not available (Why is that?)
• On Semidefinite Programming Relaxations of the Traveling Salesman Problem
• Improved analysis of an algorithm for the coupled task problem with UET jobs
• The linear ordering problem with cumulative costs
• Title not available (Why is that?)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
• A random keys based genetic algorithm for the target visitation problem

Cited In (5)

• The target visitation arc routing 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

• Matlab
• TSPLIB
• SeDuMi
• Concorde
• Biq Mac

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)