Pages that link to "Item:Q908860"

The following pages link to Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860):

Displaying 12 items.

• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
• A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
• A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984) (← links)
• An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
• A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
• A lower bound for the shortest Hamiltonean path in directed graphs (Q1814249) (← links)
• Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
• The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)