A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem

DOI10.1016/j.cor.2023.106151OpenAlexW4317821396MaRDI QIDQ6164361

André Rossi, Mingyu Xiao, Yi Zhou, Mengfan Ma, Ziyang Men

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106151

zbMATH Keywords

branch-and-cutlocal branchinginteger linear programvertex-separatorpartitioned Steiner tree problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Integer programming formulations for the elementary shortest path problem
• Proximity search for 0--1 mixed-integer convex programming
• Local branching
• Thinning out Steiner trees: a node-based model for uniform edge costs
• A branch-and-cut algorithm for the Steiner tree problem with delays
• The multi-weighted Steiner tree problem: A reformulation by intersection
• Solving Connected Subgraph Problems in Wildlife Conservation
• Connections in Networks: Hardness of Feasibility Versus Optimality
• A new approach to the maximum-flow problem
• A node‐based ILP formulation for the node‐weighted dominating Steiner problem
• Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• The steiner problem in graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem