Pages that link to "Item:Q1753556"

The following pages link to An algorithmic framework for the exact solution of tree-star problems (Q1753556):

Displaying 19 items.

• The solutions of two star-height problems for regular trees (Q760212) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• The connected facility location polytope (Q1686059) (← links)
• An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• The complete optimal stars-clustering-tree problem (Q2473041) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• Dual-based local search for the connected facility location and related problems (Q2899090) (← links)
• (Q3113716) (← links)
• On the Optimal Stars Clustering Tree Problem (Q3439552) (← links)
• (Q4782560) (← links)
• A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
• (Q5264741) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)