Pages that link to "Item:Q3292045"

The following pages link to A Dynamic Programming Approach to Sequencing Problems (Q3292045):

Displaying 10 items.

• The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
• Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
• Exact algorithms for edge domination (Q1945174) (← links)
• Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
• The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
• Good triangulations yield good tours (Q2384914) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• Exact Algorithms for Edge Domination (Q3503591) (← links)
• Validation of subgradient optimization (Q4770776) (← links)
• The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)