On the public citation graph

Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5

https://doi.org/10.1137/0804046
0 signed · 99 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01389000openalex-snapshot
Parallel depth first search. Part I. Implementation
inferredcites →https://doi.org/10.1007/bf01389001openalex-snapshot
Parallel depth first search. Part II. Analysis
inferredcites →https://doi.org/10.1007/bf01581188openalex-snapshot
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
inferredcites →https://doi.org/10.1007/bf01589406openalex-snapshot
A simulation tool for the performance evaluation of parallel branch and bound algorithms
inferredcites →https://doi.org/10.1007/bf02023053openalex-snapshot
Large-scale 0–1 linear programming on distributed workstations
inferredcites →https://doi.org/10.1007/bf02024489openalex-snapshot
Efficiency considerations in the implementation of parallel branch-and-bound
inferredcites →https://doi.org/10.1007/bf02073939openalex-snapshot
Implementation of parallel branch-and-bound algorithms – experiences with the graph partitioning problem
inferredcites →https://doi.org/10.1016/0166-218x(87)90022-9openalex-snapshot
A parallel branch and bound algorithm for the quadratic assignment problem
inferredcites →https://doi.org/10.1016/0167-6377(88)90067-3openalex-snapshot
Branch-and-bound and parallel computation: A historical note
inferredcites →https://doi.org/10.1016/0377-2217(81)90010-2openalex-snapshot
Introduction to operations research
inferredcites →https://doi.org/10.1016/0377-2217(88)90160-9openalex-snapshot
A parallel integer linear programming algorithm
inferredcites →https://doi.org/10.1016/c2013-0-08299-0openalex-snapshot
Introduction to Parallel Algorithms and Architectures
inferredcites →https://doi.org/10.1016/s0167-5060(08)70351-0openalex-snapshot
Branch and Bound Methods for Mathematical Programming Systems
inferredcites →https://doi.org/10.1016/s0167-5060(08)70352-2openalex-snapshot
Computer Codes for Problems of Integer Programming
inferredcites →https://doi.org/10.1109/32.44360openalex-snapshot
Computational efficiency of parallel combinatorial OR-tree searches
inferredcites →https://doi.org/10.1109/proc.1978.10872openalex-snapshot
Multi-microprocessors: An overview and working example
inferredcites →https://doi.org/10.1109/tc.1972.5009071openalex-snapshot
Some Computer Organizations and Their Effectiveness
inferredcites →https://doi.org/10.1109/tc.1980.1675681openalex-snapshot
Distributed Enumeration on Between Computers
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.1985.6312201openalex-snapshot
Performance of parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1287/mnsc.26.1.86openalex-snapshot
Pivot and Complement–A Heuristic for 0-1 Programming
inferredcites →https://doi.org/10.1287/mnsc.39.6.657openalex-snapshot
Solving Airline Crew Scheduling Problems by Branch-and-Cut

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0116openalex-snapshot
Branch‐and‐Bound Algorithms
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0524openalex-snapshot
MILP Software
inferred← citeshttps://doi.org/10.1007/0-387-22827-6_5openalex-snapshot
Parallel Algorithm Design for Branch and Bound
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_1openalex-snapshot
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_6openalex-snapshot
Branch, Cut, and Price: Sequential and Parallel
inferred← citeshttps://doi.org/10.1007/3-540-46043-8_60openalex-snapshot
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1007/3-540-63697-8_99openalex-snapshot
Parallel Branch and Bound algorithms for integer and mixed integer linear programming problems under PVM
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_6openalex-snapshot
Sequential and Parallel Branch-and-Bound Search under Limited-Memory Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_15openalex-snapshot
Enabling Department-Scale Supercomputing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_29openalex-snapshot
Selected Algorithmic Techniques for Parallel Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_1openalex-snapshot
Algorithms and Software for Convex Mixed Integer Nonlinear Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-1049-9_1openalex-snapshot
Coin-Or: An Open-Source Library for Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-5087-7_1openalex-snapshot
Multicommodity Capacitated Network Design
inferred← citeshttps://doi.org/10.1007/978-1-4757-3040-1_2openalex-snapshot
Quadratic Programming Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_13openalex-snapshot
Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_8openalex-snapshot
A Distributed Implementation of Asynchronous Parallel Branch and Bound
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_67openalex-snapshot
Effectiveness of Parallelizing the ILOG-CPLEX Mixed Integer Optimizer in the PUBB2 Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_18openalex-snapshot
Mixed Integer Programming: Analyzing 12 Years of Progress
inferred← citeshttps://doi.org/10.1007/bf02592208openalex-snapshot
Computational study of a family of mixed-integer quadratic programming problems
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/s10107-006-0009-0openalex-snapshot
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
inferred← citeshttps://doi.org/10.1007/s10107-023-01977-xopenalex-snapshot
A theoretical and computational analysis of full strong-branching
inferred← citeshttps://doi.org/10.1007/s10732-007-9021-7openalex-snapshot
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming
inferred← citeshttps://doi.org/10.1007/s12532-011-0025-9openalex-snapshot
MIPLIB 2010
inferred← citeshttps://doi.org/10.1007/s12532-015-0087-1openalex-snapshot
PEBBL: an object-oriented framework for scalable parallel branch and bound
inferred← citeshttps://doi.org/10.1007/s12532-017-0117-2openalex-snapshot
A branch-and-bound algorithm for instrumental variable quantile regression
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00036-9openalex-snapshot
Random allocation of jobs with weights and precedence
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00060-7openalex-snapshot
Application of a hybrid genetic algorithm to airline crew scheduling
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/b978-0-12-802961-9.00004-8openalex-snapshot
Process Optimization
inferred← citeshttps://doi.org/10.1016/j.cie.2010.07.004openalex-snapshot
Orthogonal packing of identical rectangles within isotropic convex regions
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2013.11.009openalex-snapshot
Heterogeneous parallel method for mixed integer nonlinear programming
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2021.107523openalex-snapshot
Computer aided molecular design coupled with molecular dynamics as a novel approach to design new lubricants
inferred← citeshttps://doi.org/10.1016/j.cor.2010.07.004openalex-snapshot
A computational study of parametric tabu search for 0–1 mixed integer programs
inferred← citeshttps://doi.org/10.1016/j.cor.2018.12.020openalex-snapshot
Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106043openalex-snapshot
Branch-and-refine for solving time-expanded MILP formulations
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.028openalex-snapshot
On multiprocessor task scheduling using efficient state space search approaches
inferred← citeshttps://doi.org/10.1016/j.parco.2004.05.001openalex-snapshot
Adaptive Quality Equalizing: High-performance load balancing for parallel branch-and-bound across applications and computing systems
inferred← citeshttps://doi.org/10.1016/s0045-7825(99)00241-8openalex-snapshot
Dynamic load balancing in computational mechanics
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00016-1openalex-snapshot
A distributed processing algorithm for solving integer programs using a cluster of workstations
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12002-7openalex-snapshot
Computational Integer Programming and Cutting Planes
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80014-8openalex-snapshot
Pico: An Object-Oriented Framework for Parallel Branch and Bound
inferred← citeshttps://doi.org/10.1017/s0962492913000032openalex-snapshot
Mixed-integer nonlinear optimization
inferred← citeshttps://doi.org/10.1023/a:1008699010646openalex-snapshot
Distributed versus Centralized Storage and Control for Parallel Branch and Bound: Mixed Integer Programming on the CM-5
inferred← citeshttps://doi.org/10.1023/a:1012982400848openalex-snapshot
FATCOP 2.0: Advanced Features in an Opportunistic Mixed Integer Programming Solver
inferred← citeshttps://doi.org/10.1023/a:1018960631213openalex-snapshot
Computational experience with parallel mixed integerprogramming in a distributed environment
inferred← citeshttps://doi.org/10.1023/a:1021047328089openalex-snapshot
Solving Large MINLPs on Computational Grids
inferred← citeshttps://doi.org/10.1023/b:supe.0000020179.55383.adopenalex-snapshot
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms
inferred← citeshttps://doi.org/10.1057/9780230372924_2openalex-snapshot
Implementation of Parallel Branch-and-bound Algorithms in XPRESS-MP
inferred← citeshttps://doi.org/10.1080/10556788.2017.1333612openalex-snapshot
Parallelization of the FICO Xpress-Optimizer
inferred← citeshttps://doi.org/10.1093/oso/9780198538561.003.0006openalex-snapshot
Interior point algorithms for integer programming
inferred← citeshttps://doi.org/10.1109/69.755612openalex-snapshot
State of the art in parallel search techniques for discrete optimization problems
inferred← citeshttps://doi.org/10.1109/71.598348openalex-snapshot
Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search
inferred← citeshttps://doi.org/10.1109/icpp.2000.876065openalex-snapshot
A problem-specific fault-tolerance mechanism for asynchronous, distributed systems
inferred← citeshttps://doi.org/10.1109/ipps.1996.508195openalex-snapshot
Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
inferred← citeshttps://doi.org/10.1109/iwcmc.2013.6583610openalex-snapshot
Efficient Network Coding packet selection model for QoS-based applications
inferred← citeshttps://doi.org/10.1109/superc.1994.344264openalex-snapshot
Control strategies for parallel mixed integer branch and bound
inferred← citeshttps://doi.org/10.1137/s1052623499353911openalex-snapshot
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver
inferred← citeshttps://doi.org/10.1145/602783.602785openalex-snapshot
Control strategies for parallel mixed integer branch and bound
inferred← citeshttps://doi.org/10.11606/d.45.2009.tde-06072009-130912openalex-snapshot
Algoritmos para problemas de programação não-linear com variáveis inteiras e contínuas.
inferred← citeshttps://doi.org/10.11606/t.18.2012.tde-04062012-165249openalex-snapshot
Modelo de otimização para o controle de plantas daninhas usando programação não linear inteira mista
inferred← citeshttps://doi.org/10.1287/ijoc.1030.0027openalex-snapshot
Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0340openalex-snapshot
Grid-Enabled Optimization with GAMS
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.173openalex-snapshot
A Computational Study of Search Strategies for Mixed Integer Programming
inferred← citeshttps://doi.org/10.1287/ijoc.12.1.2.11900openalex-snapshot
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
inferred← citeshttps://doi.org/10.1287/ijoc.13.3.191.12630openalex-snapshot
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0762openalex-snapshot
FiberSCIP—A Shared Memory Parallelization of SCIP
inferred← citeshttps://doi.org/10.1287/ijoc.9.1.15openalex-snapshot
How Much Communication Does Parallel Branch and Bound Need?
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
inferred← citeshttps://doi.org/10.21236/ada375528openalex-snapshot
FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Program Solver
inferred← citeshttps://doi.org/10.2172/921147openalex-snapshot
LDRD final report on massively-parallel linear programming : the parPCx system.
inferred← citeshttps://doi.org/10.5555/602770.602785openalex-snapshot
Control strategies for parallel mixed integer branch and bound
inferred← citeshttps://doi.org/10.70675/1319c64cz009bz4e91za063z16ef044df152openalex-snapshot
Centralized and distributed address correlated network coding protocols
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.