On the public citation graph
Depth-m search in branch-and-bound algorithms
0 signed · 24 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.1007/bf00998631openalex-snapshot
Theoretical comparisons of search strategies in branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/321574.321590openalex-snapshot
Accelerating List Processing in Discrete Programming
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.1287/mnsc.13.4.b176openalex-snapshot
Optimum Seeking with Branch and Bound
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.1287/opre.18.1.24openalex-snapshot
Branch-and-Bound Methods: General Formulation and Properties
inferredcites →https://doi.org/10.1287/opre.19.1.115openalex-snapshot
Technical Note—A Flexible Tree-Search Method for Integer Programming Problems
inferredcites →https://doi.org/10.1287/opre.22.1.144openalex-snapshot
A Flexible Enumeration Scheme for Zero-One Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/bf02564831openalex-snapshot
Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
inferred← citeshttps://doi.org/10.1016/0004-3702(89)90010-6openalex-snapshot
Heuristic search in restricted memory
inferred← citeshttps://doi.org/10.1016/0191-2615(84)90028-6openalex-snapshot
Control system design for an individual signalized junction
inferred← citeshttps://doi.org/10.1109/34.297950openalex-snapshot
Enhanced iterative-deepening search
inferred← citeshttps://doi.org/10.1109/tai.1992.246360openalex-snapshot
Band search: an efficient alternative to guided depth-first search
inferred← citeshttps://doi.org/10.1109/tse.1985.232550openalex-snapshot
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
inferred← citeshttps://doi.org/10.1137/s0097539789173597openalex-snapshot
The Set Union Problem with Unlimited Backtracking
inferred← citeshttps://doi.org/10.1145/63047.63106openalex-snapshot
Parallel branch and bound algorithms on hypercube multiprocessors
inferred← citeshttps://doi.org/10.15807/jorsj.21.59openalex-snapshot
THE MULTIPLE-CHOICE KNAPSACK PROBLEM
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8493openalex-snapshot
Steps Towards a Science of Heuristic Search
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.