Thinning out Steiner trees: a node-based model for uniform edge costs
From MaRDI portal
Publication:1699615
DOI10.1007/s12532-016-0111-0zbMath1387.90132OpenAlexW2522051431WikidataQ57705356 ScholiaQ57705356MaRDI QIDQ1699615
Michele Monaci, Markus Leitner, Martin Luipersbeck, Matteo Fischetti, Ivana Ljubić, Markus Sinnl, Max Resch, Domenico Salvagnin
Publication date: 23 February 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-016-0111-0
Related Items
A new branch-and-cut approach for the generalized regenerator location problem, An exact algorithm for constructing minimum Euclidean skeletons of polygons, Layered graph approaches for combinatorial optimization problems, A robust and scalable algorithm for the Steiner problem in graphs, A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem, The Influence of Preprocessing on Steiner Tree Approximations, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, Imposing Contiguity Constraints in Political Districting Models, Combinatorial Heuristics for Inventory Routing Problems, On the Exact Solution of Prize-Collecting Steiner Tree Problems, Solving the Distance-Based Critical Node Problem, The rainbow Steiner tree problem, On imposing connectivity constraints in integer programs, Optimal connected subgraphs: Integer programming formulations and polyhedra, Stronger path‐based extended formulation for the Steiner tree problem, The min-Knapsack problem with compactness constraints and applications in statistics, Solving Steiner trees: Recent advances, challenges, and perspectives, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Models and algorithms for the weighted safe set problem, A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem, Vertex covering with capacitated trees, Linear-size formulations for connected planar graph partitioning and political districting, Swap-vertex based neighborhood for Steiner tree problems, A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death, Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem, A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems, Parsimonious formulations for low-diameter clusters, Interdiction Games and Monotonicity, with Application to Knapsack Problems, Strong Steiner Tree Approximations in Practice, The Optimal Design of Low-Latency Virtual Backbones, Decomposition methods for the two-stage stochastic Steiner tree problem, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Binary Steiner trees: structural results and an exact solution approach, Solving minimum-cost shared arborescence problems, The generalized reserve set covering problem with connectivity and buffer requirements, A branch-and-cut algorithm for the edge interdiction clique problem, A branch-and-cut algorithm for the maximum covering cycle problem, An exact solution framework for the minimum cost dominating tree problem, Implications, conflicts, and reductions for Steiner trees, Implications, conflicts, and reductions for Steiner trees, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, Mixed-integer programming approaches for the tree \(t^*\)-spanner problem, The incremental connected facility location problem, Political districting to minimize cut edges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Proximity search for 0--1 mixed-integer convex programming
- On implementing the push-relabel method for the maximum flow problem
- Local branching
- On imposing connectivity constraints in integer programs
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Algorithmic graph theory and perfect graphs
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
- A dual ascent approach for steiner tree problems on a directed graph
- Solving Steiner tree problems in graphs to optimality
- A heuristic algorithm for the set covering problem
- A Heuristic Method for the Set Covering Problem
- Fast Local Search for Steiner Trees in Graphs
- The Maximum Weight Connected Subgraph Problem
