Pages that link to "Item:Q2636833"
From MaRDI portal
The following pages link to Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833):
Displayed 11 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- (Q6124757) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)