Pages that link to "Item:Q5505660"
From MaRDI portal
The following pages link to Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660):
Displaying 15 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- Linear models and computational experiments for the quadratic TSP (Q510950) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Extending single tolerances to set tolerances (Q1671336) (← 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)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- (Q6124757) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)
