Pages that link to "Item:Q3439489"
From MaRDI portal
The following pages link to Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem (Q3439489):
Displaying 7 items.
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- The labeled maximum matching problem (Q1000970) (← links)
- The rainbow spanning forest problem (Q1797922) (← links)
- Two heuristics for the rainbow spanning forest problem (Q2184043) (← links)
- A two-phase heuristic algorithm for the label printing problem (Q2701173) (← links)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
- Two heuristics for the label printing problem (Q6082184) (← links)