Pages that link to "Item:Q3312037"

The following pages link to The Traveling Salesman Problem with Many Visits to Few Cities (Q3312037):

Displaying 9 items.

• New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem (Q537638) (← links)
• The minimum backlog problem (Q888427) (← links)
• On minimal Eulerian graphs (Q1162523) (← links)
• A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
• Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
• High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system (Q2029029) (← links)
• Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
• High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
• Walk on the hypercube with minimum similarities (Q6488188) (← links)