On the public citation graph
Branch-and-bound as a higher-order function
0 signed · 51 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1002/net.3230120309openalex-snapshot
An algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230170107openalex-snapshot
Problem reduction methods and a tree generation algorithm for the steiner network problem
inferredcites →https://doi.org/10.1002/net.3230190102openalex-snapshot
An SST‐based algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230190506openalex-snapshot
Reduction tests for the steiner problem in grapsh
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_5openalex-snapshot
An Automatic Method for Solving Discrete Programming Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00289500openalex-snapshot
A faster approximation algorithm for the Steiner problem in graphs
inferredcites →https://doi.org/10.1007/bf02188551openalex-snapshot
Chapter 9 Implementation and concurrent execution of branch-and-bound algorithms
inferredcites →https://doi.org/10.1007/bf03037504openalex-snapshot
The general problem solving algorithm and its implementation
inferredcites →https://doi.org/10.1016/0004-3702(84)90004-3openalex-snapshot
General Branch and Bound, and its relation to A∗ and AO∗
inferredcites →https://doi.org/10.1016/0020-0190(86)90109-2openalex-snapshot
A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding functions
inferredcites →https://doi.org/10.1016/0020-0190(88)90225-6openalex-snapshot
Worst-case performance of Rayward-Smith's Steiner tree heuristic
inferredcites →https://doi.org/10.1016/s0004-3702(83)80009-5openalex-snapshot
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
inferredcites →https://doi.org/10.1016/s0019-9958(78)90197-3openalex-snapshot
Branch-and-bound procedure and state—space representation of combinatorial optimization problems
inferredcites →https://doi.org/10.1057/jors.1981.14openalex-snapshot
Mathematical Programming: Structures and Algorithms
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1080/0020739830140103openalex-snapshot
The computation of nearly minimal Steiner trees in graphs
inferredcites →https://doi.org/10.1093/comjnl/32.2.98openalex-snapshot
Why Functional Programming Matters
inferredcites →https://doi.org/10.1093/comjnl/8.3.250openalex-snapshot
A tree-search algorithm for mixed integer programming problems
inferredcites →https://doi.org/10.1109/mc.1985.1662926openalex-snapshot
Multiprocessing of Combinatorial Search Problems
inferredcites →https://doi.org/10.1109/tc.1984.1676453openalex-snapshot
MANIP—A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1109/tssc.1968.300136openalex-snapshot
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/321796.321808openalex-snapshot
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1287/mnsc.13.4.b176openalex-snapshot
Optimum Seeking with Branch and Bound
inferredcites →https://doi.org/10.1287/opre.13.4.517openalex-snapshot
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.1287/opre.16.2.442openalex-snapshot
Letter to the Editor—A Note on the Branch-and-Bound Principle
inferredcites →https://doi.org/10.1287/opre.18.1.24openalex-snapshot
Branch-and-Bound Methods: General Formulation and Properties
inferredcites →https://doi.org/10.2307/1910129openalex-snapshot
An Automatic Method of Solving Discrete Programming Problems
inferredcites →https://doi.org/10.2307/2987917openalex-snapshot
Combinatorial Algorithms: Theory and Practice.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_31openalex-snapshot
A parallel formulation for general branch-and-bound algorithms
inferred← citeshttps://doi.org/10.1007/bf02024489openalex-snapshot
Efficiency considerations in the implementation of parallel branch-and-bound
inferred← citeshttps://doi.org/10.1007/bfb0027121openalex-snapshot
Towards an abstract parallel branch and bound machine
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1007/bfb0030117openalex-snapshot
An interface design for general parallel branch-and-bound algorithms
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00084-0openalex-snapshot
DCABB: A distributed control architecture for branch and bound calculations
inferred← citeshttps://doi.org/10.1016/0377-2217(96)00009-4openalex-snapshot
Parallel processing for difficult combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0969-6016(94)90005-1openalex-snapshot
Computer-based environments for operations research: Classification and a pioneer system
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00094-0openalex-snapshot
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
inferred← citeshttps://doi.org/10.1023/a:1018972901171openalex-snapshot
The parallel search bench ZRAM and its applications
inferred← citeshttps://doi.org/10.1109/pccc.1995.472518openalex-snapshot
Load balancing strategy and priority of tasks in distributed environments
inferred← citeshttps://doi.org/10.1287/opre.1040.0183openalex-snapshot
Solving a Time-Space Network Formulation for the Convoy Movement Problem
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
inferred← citeshttps://doi.org/10.15637/jlecon.2219openalex-snapshot
Aylak zamanı enküçükleyen tur oluşturma problemlerinin geri izleme yöntemi ile çözümüne ilişkin bir yazılım geliştirme uygulaması
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.