Pages that link to "Item:Q2840678"

The following pages link to New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678):

Displaying 10 items.

• Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
• Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem (Q1577113) (← links)
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• Refinements of the k-tree Algorithm for the Generalized Birthday Problem (Q2795995) (← links)
• Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)