Pages that link to "Item:Q3439974"

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

Displaying 12 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)
• The rainbow spanning forest problem (Q1797922) (← links)
• Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
• Efficient formulations for the traveling car renter problem and its quota variant (Q2047185) (← links)
• Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
• Minimum label \(s\)-\(t\) cut has large integrality gaps (Q2216106) (← links)
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
• Comparison of metaheuristics for the <i>k</i>‐labeled spanning forest problem (Q5278227) (← links)