Pages that link to "Item:Q4291481"

The following pages link to Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure (Q4291481):

Displaying 38 items.

• Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
• An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
• Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
• Local and variable neighborhood search for the \(k\) -cardinality subgraph problem (Q953319) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Search-hide games on trees (Q1129971) (← links)
• \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs (Q1268220) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
• A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
• Complexity of searching an immobile hider in a graph (Q1377669) (← 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)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• A note on the $k$-minimum spanning tree problem on circles (Q1785744) (← links)
• The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
• On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
• A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
• New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678) (← links)
• Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
• Statuses and branch-weights of weighted trees (Q3070177) (← links)
• Integer Programming Formulations for the k-Cardinality Tree Problem (Q3503557) (← links)
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
• Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
• A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
• A branch and cut approach to the cardinality constrained circuit problem. (Q5957568) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)