Pages that link to "Item:Q3439974"

The following pages link to The Colorful Traveling Salesman Problem (Q3439974):

Displaying 5 items.

• The label cut problem with respect to path length and label frequency (Q313969) (← links)
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
• The labeled maximum matching problem (Q1000970) (← links)
• Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
• On the complexity of rainbow spanning forest problem (Q1749772) (← links)