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 47 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)
• An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
• The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
• Parsimonious formulations for low-diameter clusters (Q2220903) (← links)
• Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
• The incremental connected facility location problem (Q2329719) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• Models and algorithms for the weighted safe set problem (Q2686129) (← links)
• The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
• Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• Imposing Contiguity Constraints in Political Districting Models (Q5080650) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• On the Exact Solution of Prize-Collecting Steiner Tree Problems (Q5085996) (← links)
• Solving the Distance-Based Critical Node Problem (Q5087707) (← links)
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
• A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems (Q5131733) (← links)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
• The Optimal Design of Low-Latency Virtual Backbones (Q5148180) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5918437) (← links)
• Implications, conflicts, and reductions for Steiner trees (Q5925647) (← links)
• Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
• Stronger path‐based extended formulation for the Steiner tree problem (Q6068530) (← links)
• The min-Knapsack problem with compactness constraints and applications in statistics (Q6069243) (← links)
• Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem (Q6164361) (← links)
• Vertex covering with capacitated trees (Q6179715) (← links)
• Linear-size formulations for connected planar graph partitioning and political districting (Q6181361) (← links)
• Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)