Pages that link to "Item:Q3008920"

The following pages link to On minimum reload cost paths, tours, and flows (Q3008920):

Displaying 18 items.

• Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
• On minimum reload cost cycle cover (Q496639) (← links)
• An extended approach for lifting clique tree inequalities (Q498425) (← links)
• The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
• The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
• The symmetric quadratic traveling salesman problem (Q2434982) (← links)
• On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• A Polyhedral Study of the Quadratic Traveling Salesman Problem (Q2806910) (← links)
• On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
• Reload cost trees and network design (Q2913949) (← links)
• (Q5111862) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)