Pages that link to "Item:Q1824572"
From MaRDI portal
The following pages link to New lower bounds for the symmetric travelling salesman problem (Q1824572):
Displaying 29 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Nonlinear resolving functions for the travelling salesman problem (Q462011) (← links)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← links)
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- A new lower bound for the geometric traveling salesman problem in terms of discrepancy (Q991472) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (Q1281074) (← links)
- Algorithms for the minimax problem of the travelling salesman. II: Dual approach (Q1285427) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Branch-and-bound algorithm for Symmetric Travelling Salesman problem (Q1671016) (← links)
- Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Algorithms for solution of the travelling salesman problem. II: New lower bound (Q1913835) (← links)
- The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
- An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317) (← links)
- A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
- A gene-pool based genetic algorithm for TSP (Q4454481) (← links)
- An improved branching rule for the symmetric travelling salesman problem (Q4658394) (← links)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading (Q6160334) (← links)
