Pages that link to "Item:Q1003738"

The following pages link to The complexity of a minimum reload cost diameter problem (Q1003738):

Displaying 15 items.

• Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
• On minimum reload cost cycle cover (Q496639) (← links)
• The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← 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)
• On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
• On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
• Reload cost trees and network design (Q2913949) (← links)
• On minimum reload cost paths, tours, and flows (Q3008920) (← links)
• On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
• The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
• (Q5111862) (← 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)