Pages that link to "Item:Q1699615"

The following pages link to Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615):

Displaying 13 items.

• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• A new branch-and-cut approach for the generalized regenerator location problem (Q827283) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
• A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)