On the public citation graph
Theoretical comparisons of search strategies in branch-and-bound algorithms
0 signed · 104 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/bf01584074openalex-snapshot
Experiments in mixed-integer linear programming
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.1137/1009031openalex-snapshot
Integer Programming by Implicit Enumeration and Balas’ Method
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/321921.321934openalex-snapshot
Algorithms for Scheduling Independent Tasks
inferredcites →https://doi.org/10.1145/322003.322010openalex-snapshot
The Power of Dominance Relations in 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/mnsc.20.5.736openalex-snapshot
Practical Solution of Large Mixed Integer Programming Problems with Umpire
inferredcites →https://doi.org/10.1287/opre.13.6.879openalex-snapshot
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.1287/opre.15.5.915openalex-snapshot
Discrete Programming by the Filter Method
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.15807/jorsj.20.16openalex-snapshot
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1099-1425(199901/02)2:1<19::aid-jos8>3.0.co;2-sopenalex-snapshot
Optimization of template-driven scheduling mechanisms: regularity measures and computational techniques
inferred← citeshttps://doi.org/10.1002/9780470411353.ch12openalex-snapshot
Tools for Tree Searches: Branch‐and‐Bound and A Algorithms
inferred← citeshttps://doi.org/10.1002/aic.14705openalex-snapshot
Optimal design and operations of supply chain networks for water management in shale gas production: MILFP model and algorithms for the water‐energy nexus
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_29openalex-snapshot
Asynchronous parallel branch and bound and anomalies
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_35openalex-snapshot
Combinatorially Accelerated Branch-and-Bound Method for Solving the MIP Model of Process Network Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_5openalex-snapshot
A Branch and Bound Algorithm for the Quadratic Assignment Problem using a Lower Bound Based on Linear Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-9893-0_6openalex-snapshot
Heuristic graph searching
inferred← citeshttps://doi.org/10.1007/978-3-319-09129-7_8openalex-snapshot
On Simplicial Longest Edge Bisection in Lipschitz Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-02017-9_9openalex-snapshot
Searching Trees: An Essay
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf00991818openalex-snapshot
Depth-m search in branch-and-bound algorithms
inferred← citeshttps://doi.org/10.1007/bf01069644openalex-snapshot
An extremal problem on random trees
inferred← citeshttps://doi.org/10.1007/bf01070581openalex-snapshot
Discrete optimization methods for multiprocessor computer systems
inferred← citeshttps://doi.org/10.1007/bf01078264openalex-snapshot
Probability modeling of branch-and-bound method
inferred← citeshttps://doi.org/10.1007/bf01916914openalex-snapshot
Using branch-and-bound algorithms to obtain suboptimal solutions
inferred← citeshttps://doi.org/10.1007/bf01939360openalex-snapshot
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
inferred← citeshttps://doi.org/10.1007/bf02241700openalex-snapshot
An effective structured approach to finding optimal partitions of networks
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.1007/bfb0027121openalex-snapshot
Towards an abstract parallel branch and bound machine
inferred← citeshttps://doi.org/10.1007/bfb0027122openalex-snapshot
Parallel best-first branch- and-bound in discrete optimization: A framework
inferred← citeshttps://doi.org/10.1007/s00291-008-0133-8openalex-snapshot
On a branch-and-bound approach for a Huff-like Stackelberg location problem
inferred← citeshttps://doi.org/10.1007/s00500-021-06408-7openalex-snapshot
Construction facilities location selection for urban linear infrastructure maintenance projects using uniform cost search method
inferred← citeshttps://doi.org/10.1007/s10287-021-00389-6openalex-snapshot
Some new perspectives for solving 0–1 integer programming problems using Balas method
inferred← citeshttps://doi.org/10.1007/s10898-007-9157-xopenalex-snapshot
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
inferred← citeshttps://doi.org/10.1007/s11227-012-0783-9openalex-snapshot
A threaded approach of the quadratic bi-blending algorithm
inferred← citeshttps://doi.org/10.1007/s11750-012-0253-9openalex-snapshot
Pareto optimality and robustness in bi-blending problems
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00137-3openalex-snapshot
Performances of parallel branch and bound algorithms with best-first search
inferred← citeshttps://doi.org/10.1016/0167-8655(94)90094-9openalex-snapshot
New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90040-xopenalex-snapshot
A new node selection strategy in the branch-and-bound procedure
inferred← citeshttps://doi.org/10.1016/b978-0-08-026476-9.50007-1openalex-snapshot
Scheduling Problems and Combinatorial Programming
inferred← citeshttps://doi.org/10.1016/b978-0-934613-03-3.50007-6openalex-snapshot
A PROBLEM SIMILARITY APPROACH TO DEVISING HEURISTICS: FIRST RESULTS
inferred← citeshttps://doi.org/10.1016/c2013-0-07694-3openalex-snapshot
Readings in Artificial Intelligence
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.005openalex-snapshot
Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
inferred← citeshttps://doi.org/10.1016/j.dss.2020.113301openalex-snapshot
IoT-based location and quality decision-making in emerging shared parking facilities with competition
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.01.056openalex-snapshot
The semi-continuous quadratic mixture design problem: Description and branch-and-bound approach
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.04.040openalex-snapshot
The stochastic transportation problem with single sourcing
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.05.016openalex-snapshot
Parallel algorithms for computing the smallest binary tree size in unit simplex refinement
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.127354openalex-snapshot
A linear multivariate decision tree with branch-and-bound components
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90197-3openalex-snapshot
Branch-and-bound procedure and state—space representation of combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0888-613x(99)00020-1openalex-snapshot
Fuzzy model-based predictive control using Takagi–Sugeno models
inferred← citeshttps://doi.org/10.1023/a:1009917222929openalex-snapshot
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions
inferred← citeshttps://doi.org/10.1023/a:1016246616462openalex-snapshot
Search Heuristics for Box Decomposition Methods
inferred← citeshttps://doi.org/10.1049/iet-gtd.2016.1071openalex-snapshot
Total supply capability considering distribution network reconfiguration under N − k transformer contingency and the decomposition method
inferred← citeshttps://doi.org/10.1080/00207547908919634openalex-snapshot
Job-shop scheduling heuristics with local neighbourhood search
inferred← citeshttps://doi.org/10.1093/ajae/aaq068openalex-snapshot
Reliability of Statistical Software
inferred← citeshttps://doi.org/10.1109/32.44360openalex-snapshot
Computational efficiency of parallel combinatorial OR-tree searches
inferred← citeshttps://doi.org/10.1109/32.6177openalex-snapshot
Efficient branch-and-bound algorithms on a two-level memory system
inferred← citeshttps://doi.org/10.1109/acc.2015.7172265openalex-snapshot
Fast optimization algorithms for large-scale mixed-integer linear fractional programming problems
inferred← citeshttps://doi.org/10.1109/access.2021.3066789openalex-snapshot
Efficient Computation Offloading in Edge Computing Enabled Smart Home
inferred← citeshttps://doi.org/10.1109/camp.1993.622490openalex-snapshot
Scalable combinatorial search engine
inferred← citeshttps://doi.org/10.1109/cvpr.2017.258openalex-snapshot
Efficient Global Point Cloud Alignment Using Bayesian Nonparametric Mixtures
inferred← citeshttps://doi.org/10.1109/icpp.2006.40openalex-snapshot
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
inferred← citeshttps://doi.org/10.1109/iti.2006.1708562openalex-snapshot
Anomalies in distributed branch-and-cut solving of the capacitated vehicle routing problem
inferred← citeshttps://doi.org/10.1109/paap.2012.41openalex-snapshot
A Bridging Model for Branch-and-Bound Algorithms on Multi-core Architectures
inferred← citeshttps://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferred← citeshttps://doi.org/10.1109/tpwrs.2014.2375322openalex-snapshot
A Bi-Level Branch and Bound Method for Economic Dispatch With Disjoint Prohibited Zones Considering Network Losses
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.1109/tste.2015.2494587openalex-snapshot
A Two-Stage Robust Reactive Power Optimization Considering Uncertain Wind Power Integration in Active Distribution Networks
inferred← citeshttps://doi.org/10.1109/twc.2015.2495163openalex-snapshot
Low Complexity Detection Algorithms in Large-Scale MIMO Systems
inferred← citeshttps://doi.org/10.1109/vtc2021-fall52928.2021.9625062openalex-snapshot
Efficient Computation Offloading for Edge-cloud Collaborative Networks
inferred← citeshttps://doi.org/10.1137/s1052623494273393openalex-snapshot
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.1137/s1064827599357590openalex-snapshot
Interval Algorithms for Finding the Minimal Root in a Set of Multiextremal One-Dimensional Nondifferentiable Functions
inferred← citeshttps://doi.org/10.1145/2422.322422openalex-snapshot
Random Trees and the Analysis of Branch and Bound Procedures
inferred← citeshttps://doi.org/10.1145/322003.322010openalex-snapshot
The Power of Dominance Relations in Branch-and-Bound Algorithms
inferred← citeshttps://doi.org/10.1145/63047.63106openalex-snapshot
Parallel branch and bound algorithms on hypercube multiprocessors
inferred← citeshttps://doi.org/10.1145/773453.808166openalex-snapshot
The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems
inferred← citeshttps://doi.org/10.1287/mnsc.31.12.1533openalex-snapshot
Branch and Bound Experiments in Convex Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1287/moor.1.3.287openalex-snapshot
Computational Efficiency of Approximate Branch-and-Bound Algorithms
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1010680openalex-snapshot
Fast and versatile sequence-independent protein docking for nanomaterials design using RPXDock
inferred← citeshttps://doi.org/10.14232/actacyb.19.1.2009.9openalex-snapshot
Determining Initial Bound by "Ray-method" in Branch and Bound Procedure
inferred← citeshttps://doi.org/10.1505/146554824839334650openalex-snapshot
Associations between forest harvest scheduling and artificial intelligence
inferred← citeshttps://doi.org/10.15807/jorsj.20.16openalex-snapshot
ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
inferred← citeshttps://doi.org/10.15807/jorsj.21.59openalex-snapshot
THE MULTIPLE-CHOICE KNAPSACK PROBLEM
inferred← citeshttps://doi.org/10.15807/jorsj.25.292openalex-snapshot
THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS
inferred← citeshttps://doi.org/10.21236/ada560013openalex-snapshot
Theoretical and Experimental Analysis of an Evolutionary Social-Learning Game
inferred← citeshttps://doi.org/10.2307/1240622openalex-snapshot
Reliability of Linear Programming Software: An Experience with the IBM Mathematical Programming System Series
inferred← citeshttps://doi.org/10.2514/1.40034openalex-snapshot
Path-Planning with Avoidance Using Nonlinear Branch-and-Bound Optimization
inferred← citeshttps://doi.org/10.2514/6.2008-6463openalex-snapshot
Comparison of Branching Strategies for Path-Planning with Avoidance Using Nonlinear Branch-and-Bound
inferred← citeshttps://doi.org/10.32920/26052688openalex-snapshot
Solving Binary Integer Programing Problems With Balas' Additive Algorithm Using Graphics Processing Units
inferred← citeshttps://doi.org/10.32920/26052688.v1openalex-snapshot
Solving Binary Integer Programing Problems With Balas' Additive Algorithm Using Graphics Processing Units
inferred← citeshttps://doi.org/10.4018/979-8-3693-7117-6.ch006openalex-snapshot
Branch and Bound Combined Design of Experiment Algorithm
inferred← citeshttps://doi.org/10.7282/t32n52pzopenalex-snapshot
Optimization in logical analysis of data
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.