On the public citation graph
Large-scale 0–1 linear programming on distributed workstations
0 signed · 67 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/nav.3800060109openalex-snapshot
Note on solving linear programs in integers
inferredcites →https://doi.org/10.1002/spe.4380210702openalex-snapshot
Design and implementation of a distributed file system
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-82450-0_13openalex-snapshot
Parallel Computing in Optimization
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/bf01939360openalex-snapshot
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
inferredcites →https://doi.org/10.1007/bf02186477openalex-snapshot
A parallel algorithm for generalized networks
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/0141-9331(87)90305-xopenalex-snapshot
Performance models of multiprocessor systems
inferredcites →https://doi.org/10.1016/0141-9331(87)90581-3openalex-snapshot
Performance models of multiprocessor systems
inferredcites →https://doi.org/10.1016/0166-218x(86)90057-0openalex-snapshot
An introduction to parallelism in combinatorial optimization
inferredcites →https://doi.org/10.1016/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
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/0167-6377(90)90031-yopenalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/s0167-5060(08)70831-8openalex-snapshot
Covering, Packing and Knapsack Problems
inferredcites →https://doi.org/10.1057/jors.1983.14openalex-snapshot
Modern Applied Mathematics: Optimization and Operations Research
inferredcites →https://doi.org/10.1090/s0002-9904-1958-10224-4openalex-snapshot
Outline of an algorithm for integer solutions to linear programs
inferredcites →https://doi.org/10.1109/mc.1985.1662926openalex-snapshot
Multiprocessing of Combinatorial Search Problems
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.1109/tse.1987.233513openalex-snapshot
The Crystal Multicomputer: Design and Implementation Experience
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/22719.24067openalex-snapshot
DIB—a distributed implementation of backtracking
inferredcites →https://doi.org/10.1145/355972.355976openalex-snapshot
The Design of the XMP Linear Programming Library
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1159/000273299openalex-snapshot
Der Saccus endolymphaticus bei Entzündungsprozessen
inferredcites →https://doi.org/10.1287/mnsc.10.2.316openalex-snapshot
Preventive Maintenance Scheduling by Mathematical Programming
inferredcites →https://doi.org/10.1287/mnsc.15.9.481openalex-snapshot
Integer Linear Programming: A Study in Computational Efficiency
inferredcites →https://doi.org/10.1287/opre.19.1.19openalex-snapshot
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
inferredcites →https://doi.org/10.1287/opre.19.6.1393openalex-snapshot
Hypercylindrically Deduced Cuts in Zero-One Integer Programs
inferredcites →https://doi.org/10.1287/opre.31.5.803openalex-snapshot
Solving Large-Scale Zero-One Linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.33.4.803openalex-snapshot
Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
inferredcites →https://doi.org/10.21236/ada123327openalex-snapshot
A Study in Parallel Computation - The Traveling Salesman Problem
inferredcites →https://doi.org/10.2307/2581087openalex-snapshot
Operations Research -- An Introduction
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/3008276openalex-snapshot
Operations Research: An Introduction.
inferredcites →https://doi.org/10.5555/800052.801879openalex-snapshot
MANIP-a parallel computer system for implementing 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.1007/3-540-61478-8_93openalex-snapshot
Illustrating constraint programming systems in logistic planning
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-3-642-79763-7_26openalex-snapshot
Bestimmung optimaler Einsatzpläne für Flugpersonal
inferred← citeshttps://doi.org/10.1007/bfb0027123openalex-snapshot
Building a parallel branch and bound library
inferred← citeshttps://doi.org/10.1016/0167-6377(93)90050-qopenalex-snapshot
Experiments with parallel branch-and-bound algorithms for the set covering problem
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/0895-7177(95)00092-gopenalex-snapshot
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.02.010openalex-snapshot
A distributed computation algorithm for solving portfolio problems with integer variables
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/s0360-8352(00)00042-5openalex-snapshot
Statistically assessing distributed computing approaches
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00430-1openalex-snapshot
Combinatorial optimization: Current successes and directions for the future
inferred← citeshttps://doi.org/10.1023/a:1018960631213openalex-snapshot
Computational experience with parallel mixed integerprogramming in a distributed environment
inferred← citeshttps://doi.org/10.1057/jors.1992.77openalex-snapshot
Experiments in Solving Mixed Integer Programming Problems on a Small Array of Transputers
inferred← citeshttps://doi.org/10.1080/07408179808966477openalex-snapshot
Distributed computing approaches toward manufacturing scheduling problems
inferred← citeshttps://doi.org/10.1109/acssc.1992.269088openalex-snapshot
On the parallel solution of set covering and set partitioning problems
inferred← citeshttps://doi.org/10.1137/0804046openalex-snapshot
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
inferred← citeshttps://doi.org/10.12785/amis/080425openalex-snapshot
A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
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.12.1.2.11900openalex-snapshot
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
inferred← citeshttps://doi.org/10.1287/mnsc.39.6.657openalex-snapshot
Solving Airline Crew Scheduling Problems by Branch-and-Cut
inferred← citeshttps://doi.org/10.1287/opre.42.6.1042openalex-snapshot
Parallel Branch-and-Branch Algorithms: Survey and Synthesis
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.