Pages that link to "Item:Q987690"

The following pages link to The minimum reload \(s-t\) path, trail and walk problems (Q987690):

Displaying 20 items.

• On minimum reload cost cycle cover (Q496639) (← links)
• Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
• The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
• The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
• Paths and trails in edge-colored weighted graphs (Q2333812) (← 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)
• Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
• Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
• On minimum reload cost paths, tours, and flows (Q3008920) (← links)
• The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
• (Q5111862) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Complexity of edge coloring with minimum reload/changeover costs (Q5226172) (← links)
• Minimum reload cost cycle cover in complete graphs (Q5241427) (← links)
• Minimum reload cost graph factors (Q5918369) (← links)
• Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
• Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)