On the public citation graph
The Steiner tree polytope and related polyhedra
0 signed · 113 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230130405openalex-snapshot
The perfectly matchable subgraph polytope of a bipartite graph
inferredcites →https://doi.org/10.1002/net.3230170102openalex-snapshot
The node‐weighted steiner tree problem
inferredcites →https://doi.org/10.1002/net.3230170109openalex-snapshot
Forbidden subgraphs and graph decomposition
inferredcites →https://doi.org/10.1002/net.3230170309openalex-snapshot
Some generalizations of the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230230104openalex-snapshot
A catalog of steiner tree formulations
inferredcites →https://doi.org/10.1007/3-540-19488-6_105openalex-snapshot
Problems easy for tree-decomposable graphs extended abstract
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/bf01580723openalex-snapshot
On the stable set polytope of a series-parallel graph
inferredcites →https://doi.org/10.1007/bf01582008openalex-snapshot
The traveling salesman problem on a graph and some related integer polyhedra
inferredcites →https://doi.org/10.1007/bf01582572openalex-snapshot
Two-edge connected spanning subgraphs and polyhedra
inferredcites →https://doi.org/10.1007/bf01582573openalex-snapshot
The Steiner tree problem I: Formulations, compositions and extension of facets
inferredcites →https://doi.org/10.1007/bf01582574openalex-snapshot
The Steiner tree problem II: Properties and classes of facets
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1016/0012-365x(79)90160-2openalex-snapshot
Polytope des independants d'un graphe serie-parallele
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0166-218x(92)00035-kopenalex-snapshot
Arborescence polytopes for series-parallel graphs
inferredcites →https://doi.org/10.1016/0196-6774(86)90018-0openalex-snapshot
Generalized steiner problem in series-parallel networks
inferredcites →https://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs
inferredcites →https://doi.org/10.1287/mnsc.17.3.200openalex-snapshot
A Selection Problem of Shared Fixed Costs and Network Flows
inferredcites →https://doi.org/10.1287/opre.38.1.127openalex-snapshot
Polyhedral Characterization of Discrete Dynamic Programming
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4682185openalex-extracted
Formulations and Branch-and-Cut Algorithms for the Heterogeneous Fleet Vehicle Routing Problem with Due Dates
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199810)32:3<207::aid-net5>3.0.co;2-oopenalex-snapshot
Solving Steiner tree problems in graphs to optimality
inferred← citeshttps://doi.org/10.1002/9781118600283.ch3openalex-snapshot
A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems
inferred← citeshttps://doi.org/10.1002/9781119005384.ch3openalex-snapshot
A Comparison of Some Valid Inequality Generation Methods for General 0–1 Problems
inferred← citeshttps://doi.org/10.1002/net.10105openalex-snapshot
The generalized minimum spanning tree problem: Polyhedral analysis and branch‐and‐cut algorithm
inferred← citeshttps://doi.org/10.1002/net.20046openalex-snapshot
Strong formulations for network design problems with connectivity requirements
inferred← citeshttps://doi.org/10.1002/net.20072openalex-snapshot
Design of Survivable Networks: A survey
inferred← citeshttps://doi.org/10.1002/net.20274openalex-snapshot
Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
inferred← citeshttps://doi.org/10.1002/net.21913openalex-snapshot
A linear programming based approach to the Steiner tree problem with a fixed number of terminals
inferred← citeshttps://doi.org/10.1002/net.21972openalex-snapshot
Weighted target set selection on trees and cycles
inferred← citeshttps://doi.org/10.1002/net.22005openalex-snapshot
Solving Steiner trees: Recent advances, challenges, and perspectives
inferred← citeshttps://doi.org/10.1002/net.22130openalex-snapshot
Vertex covering with capacitated trees
inferred← citeshttps://doi.org/10.1002/net.3230230104openalex-snapshot
A catalog of steiner tree formulations
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_19openalex-snapshot
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_5openalex-snapshot
Polyhedral Approaches for the Steiner Tree Problem on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_8openalex-snapshot
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-62912-9_32openalex-snapshot
VNS-Based Matheuristic Approach to Group Steiner Tree with Problem-Specific Node Release Strategy
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_5openalex-snapshot
Steiner Trees in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_125openalex-snapshot
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_62openalex-snapshot
The Fractional Prize-Collecting Steiner Tree Problem on Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_29openalex-snapshot
Hypergraphic LP Relaxations for Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_6openalex-snapshot
Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem
inferred← citeshttps://doi.org/10.1007/pl00011434openalex-snapshot
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut
inferred← citeshttps://doi.org/10.1007/s10107-005-0606-3openalex-snapshot
Decomposition and Dynamic Cut Generation in Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/s10107-005-0660-xopenalex-snapshot
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s10107-006-0046-8openalex-snapshot
Traveling salesman path problems
inferred← citeshttps://doi.org/10.1007/s10107-009-0289-2openalex-snapshot
A partition-based relaxation for Steiner trees
inferred← citeshttps://doi.org/10.1007/s10107-016-1094-3openalex-snapshot
An extended formulation of the convex recoloring problem on a tree
inferred← citeshttps://doi.org/10.1007/s10107-019-01460-6openalex-snapshot
Stronger MIP formulations for the Steiner forest problem
inferred← citeshttps://doi.org/10.1007/s10479-005-3977-1openalex-snapshot
Non Delayed Relax-and-Cut Algorithms
inferred← citeshttps://doi.org/10.1007/s10589-025-00726-4openalex-snapshot
Formulations and algorithms for the simple cycle problem
inferred← citeshttps://doi.org/10.1007/s11590-022-01904-7openalex-snapshot
General variable neighborhood search approach to group steiner tree problem
inferred← citeshttps://doi.org/10.1007/s13675-015-0035-xopenalex-snapshot
Optimal capacitated ring trees
inferred← citeshttps://doi.org/10.1016/0166-218x(92)00035-kopenalex-snapshot
Arborescence polytopes for series-parallel graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(96)00015-6openalex-snapshot
k-edge connected polyhedra on series-parallel graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126623openalex-snapshot
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2010.07.002openalex-snapshot
MIP models for connected facility location: A theoretical and computational study
inferred← citeshttps://doi.org/10.1016/j.cor.2017.01.014openalex-snapshot
Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
inferred← citeshttps://doi.org/10.1016/j.dam.2008.02.014openalex-snapshot
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.017openalex-snapshot
The k -Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.016openalex-snapshot
Chvátal–Gomory cuts for the Steiner tree problem
inferred← citeshttps://doi.org/10.1016/j.disc.2004.08.017openalex-snapshot
On survivable network polyhedra
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.026openalex-snapshot
Polyhedral study of the connected subgraph problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.08.006openalex-snapshot
Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.08.010openalex-snapshot
The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.01.004openalex-snapshot
On the feedback vertex set polytope of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.05.006openalex-snapshot
Binary Steiner trees: Structural results and an exact solution approach
inferred← citeshttps://doi.org/10.1016/j.trb.2024.103104openalex-snapshot
Formulations and branch-and-cut algorithms for the heterogeneous fleet vehicle routing problem with soft time deadlines
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00311-5openalex-snapshot
Steiner trees and polyhedra
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00348-1openalex-snapshot
Cutting planes in integer and mixed integer programming
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00380-9openalex-snapshot
Strong lower bounds for the prize collecting Steiner problem in graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00200-0openalex-snapshot
A note on the generalized steiner tree polytope
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00059-9openalex-snapshot
Using a hybrid of exact and genetic algorithms to design survivable networks
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00359-4openalex-snapshot
The Steiner cycle polytope
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00404-6openalex-snapshot
Generalized network design problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00306-3openalex-snapshot
Algorithms for a multi-level network optimization problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00083-1openalex-snapshot
Projections of the capacitated network loading problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80126-4openalex-snapshot
Chapter 9 Optimal trees
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00227-6openalex-snapshot
Generating lower bounds for the prize collecting Steiner problem in graphs
inferred← citeshttps://doi.org/10.1023/a:1009893108387openalex-snapshot
Steiner k-Edge Connected Subgraph Polyhedra
inferred← citeshttps://doi.org/10.1023/a:1023670814370openalex-snapshot
A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem
inferred← citeshttps://doi.org/10.1023/a:1026546708757openalex-snapshot
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
inferred← citeshttps://doi.org/10.1051/ro/2022101openalex-snapshot
Bounded-degree rooted tree and TDI-ness
inferred← citeshttps://doi.org/10.1080/00207543.2010.496797openalex-snapshot
Integrated order selection and production scheduling under MTO strategy
inferred← citeshttps://doi.org/10.1080/01605682.2023.2253852openalex-snapshot
Operational Research: methods and applications
inferred← citeshttps://doi.org/10.1080/03155986.2006.11732743openalex-snapshot
Steiner Tree Problems With Profits
inferred← citeshttps://doi.org/10.1109/cjece.2006.259174openalex-snapshot
An efficient graph-based steiner tree heuristic for the global routing of macro cells
inferred← citeshttps://doi.org/10.1109/codit.2014.6996883openalex-snapshot
Polyhedral study for the maximum bounded r-tree problem
inferred← citeshttps://doi.org/10.1109/drcn.2016.7470839openalex-snapshot
Cables network design optimization for the Fiber To The Home
inferred← citeshttps://doi.org/10.1109/infcom.1998.662907openalex-snapshot
Optimal packing of group multicastings
inferred← citeshttps://doi.org/10.1137/110845793openalex-snapshot
Hypergraphic LP Relaxations for Steiner Trees
inferred← citeshttps://doi.org/10.1137/s1052623400322287openalex-snapshot
The Steiner Traveling Salesman Polytope and Related Polyhedra
inferred← citeshttps://doi.org/10.11606/d.45.2005.tde-20210729-143431openalex-snapshot
O problema de Steiner com grupos
inferred← citeshttps://doi.org/10.1201/9781420039597-9openalex-snapshot
Decomposition in Integer Linear Programming
inferred← citeshttps://doi.org/10.1201/9781420039597.ch4openalex-snapshot
Decomposition in Integer Linear Programming
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1095openalex-snapshot
Influence Maximization with Latency Requirements on Social Networks
inferred← citeshttps://doi.org/10.1287/trsc.2013.0500openalex-snapshot
A Branch-and-Cut-and-Price Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.4230/lipics.esa.2018.70openalex-snapshot
An Exact Algorithm for the Steiner Forest Problem
inferred← citeshttps://doi.org/10.48550/arxiv.2002.07912openalex-snapshot
Simplex based Steiner tree instances yield large integrality gaps for the bidirected cut relaxation
inferred← citeshttps://doi.org/10.70675/229025d0z64e4z4bbcza3f5zb5dae67e8689openalex-snapshot
Maximum Bounded Rooted-Tree Problem : Algorithms and Polyhedra
inferred← citeshttps://doi.org/10.70675/b353448dz12a2z4eb0za7fbz52b6d63b17e8openalex-snapshot
Optimal design of Fiber To The Home networks
inferred← citeshttps://doi.org/10.7232/jkiie.2011.37.3.191openalex-snapshot
A Comparison of Group Steiner Tree Formulations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.