Pages that link to "Item:Q342101"

The following pages link to Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101):

Displaying 10 items.

• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
• Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
• The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms (Q2273677) (← links)
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
• An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search (Q6070498) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)