On the public citation graph
Tree polytope on 2-trees
0 signed · 35 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/net.3230100207openalex-snapshot
An integer linear programming approach to the steiner problem in graphs
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.3230200110openalex-snapshot
Faster exact algorithms for steiner trees in planar networks
inferredcites →https://doi.org/10.1007/bf01553886openalex-snapshot
Fast heuristic algorithms for rectilinear steiner trees
inferredcites →https://doi.org/10.1007/bf01758777openalex-snapshot
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
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/0020-0190(88)90066-xopenalex-snapshot
A faster approximation algorithm for the Steiner problem in graphs
inferredcites →https://doi.org/10.1016/0167-6377(92)90075-eopenalex-snapshot
Steiner trees with n terminals among n + 1 nodes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.22005openalex-snapshot
Solving Steiner trees: Recent advances, challenges, and perspectives
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/s10107-005-0606-3openalex-snapshot
Decomposition and Dynamic Cut Generation in Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/s10107-010-0368-4openalex-snapshot
Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
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.1016/0167-6377(96)00015-6openalex-snapshot
k-edge connected polyhedra on series-parallel graphs
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.disopt.2009.01.004openalex-snapshot
On the feedback vertex set polytope of a series–parallel graph
inferred← citeshttps://doi.org/10.1016/j.seps.2011.02.001openalex-snapshot
Planning rapid transit networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00311-5openalex-snapshot
Steiner trees and polyhedra
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/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:1026546708757openalex-snapshot
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
inferred← citeshttps://doi.org/10.1080/03155986.2006.11732743openalex-snapshot
Steiner Tree Problems With Profits
inferred← citeshttps://doi.org/10.1137/s1052623400322287openalex-snapshot
The Steiner Traveling Salesman Polytope and Related Polyhedra
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
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.