On the public citation graph

On-line bin packing ? A restricted survey

https://doi.org/10.1007/bf01415672
0 signed · 102 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.1006/jagm.1996.0005openalex-snapshot
On the Asymptotic Worst Case Behavior of Harmonic Fit
inferredcites →https://doi.org/10.1007/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/978-3-7091-2748-3openalex-snapshot
Analysis and Design of Algorithms in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-7091-4338-4_3openalex-snapshot
Approximation Algorithms for Bin-Packing — An Updated Survey
inferredcites →https://doi.org/10.1007/bf00264439openalex-snapshot
Lower bounds for on-line two-dimensional packing algorithms
inferredcites →https://doi.org/10.1007/bf00289157openalex-snapshot
An on-line algorithm for variable-sized bin packing
inferredcites →https://doi.org/10.1007/bf02243816openalex-snapshot
Besk-k-Fit bin packing
inferredcites →https://doi.org/10.1007/bf02246509openalex-snapshot
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
inferredcites →https://doi.org/10.1007/bf02248693openalex-snapshot
Repacking helps in bounded space on-line bind-packing
inferredcites →https://doi.org/10.1016/0020-0190(80)90121-0openalex-snapshot
A 2.5 times optimal algorithm for packing in two dimensions
inferredcites →https://doi.org/10.1016/0020-0190(92)90023-oopenalex-snapshot
Does randomization help in on-line bin packing?
inferredcites →https://doi.org/10.1016/0020-0190(92)90223-iopenalex-snapshot
An improved lower bound for on-line bin packing algorithms
inferredcites →https://doi.org/10.1016/0097-3165(76)90001-7openalex-snapshot
Resource constrained scheduling as generalized bin packing
inferredcites →https://doi.org/10.1016/0166-218x(88)90052-2openalex-snapshot
Online algorithms for a dual version of bin packing
inferredcites →https://doi.org/10.1016/0166-218x(88)90089-3openalex-snapshot
Online variable-sized bin packing
inferredcites →https://doi.org/10.1016/0166-218x(91)90087-dopenalex-snapshot
Improved bounds for harmonic-based bin packing algorithms
inferredcites →https://doi.org/10.1016/0166-218x(93)90037-oopenalex-snapshot
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
inferredcites →https://doi.org/10.1016/0167-6377(88)90060-0openalex-snapshot
Next-fit packs a list and its reverse into the same number of bins
inferredcites →https://doi.org/10.1016/0167-6377(89)90027-8openalex-snapshot
Multidimensional on-line bin packing: Algorithms and worst-case analysis
inferredcites →https://doi.org/10.1016/0167-6377(93)90004-zopenalex-snapshot
An on-line algorithm for multidimensional bin packing
inferredcites →https://doi.org/10.1016/0196-6774(81)90034-1openalex-snapshot
A algorithm for two-dimensional packing
inferredcites →https://doi.org/10.1016/0196-6774(84)90004-xopenalex-snapshot
On a dual version of the one-dimensional bin packing problem
inferredcites →https://doi.org/10.1016/0196-6774(89)90031-xopenalex-snapshot
On-line bin packing in linear time
inferredcites →https://doi.org/10.1016/s0020-0190(80)90077-0openalex-snapshot
A lower bound for on-line bin packing
inferredcites →https://doi.org/10.1016/s0022-0000(74)80026-7openalex-snapshot
Fast algorithms for bin packing
inferredcites →https://doi.org/10.1080/00029890.1947.11991798openalex-snapshot
The Approximation of Numbers as Sums of Reciprocals
inferredcites →https://doi.org/10.1137/0117039openalex-snapshot
Bounds on Multiprocessing Timing Anomalies
inferredcites →https://doi.org/10.1137/0203025openalex-snapshot
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/0204015openalex-snapshot
Bounds for Multiprocessor Scheduling with Resource Constraints
inferredcites →https://doi.org/10.1137/0209064openalex-snapshot
Orthogonal Packings in Two Dimensions
inferredcites →https://doi.org/10.1137/0212033openalex-snapshot
Shelf Algorithms for Two-Dimensional Packing Problems
inferredcites →https://doi.org/10.1137/0215016openalex-snapshot
Variable Sized Bin Packing
inferredcites →https://doi.org/10.1137/0222004openalex-snapshot
Tight Worst-Case Performance Bounds for Next- k -Fit Bin Packing
inferredcites →https://doi.org/10.1137/0406045openalex-snapshot
Improved Space for Bounded-Space, On-Line Bin-Packing
inferredcites →https://doi.org/10.1137/0603007openalex-snapshot
On Packing Two-Dimensional Bins
inferredcites →https://doi.org/10.1137/0607041openalex-snapshot
Parametric Lower Bound for On-Line Bin-Packing
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/321906.321917openalex-snapshot
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
inferredcites →https://doi.org/10.1145/322186.322187openalex-snapshot
New Algorithms for Bin Packing
inferredcites →https://doi.org/10.1145/3828.3833openalex-snapshot
A simple on-line bin-packing algorithm
inferredcites →https://doi.org/10.1147/rd.215.0443openalex-snapshot
Multidimensional Bin Packing Algorithms
inferredcites →https://doi.org/10.1287/mnsc.34.3.266openalex-snapshot
Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics
inferredcites →https://doi.org/10.2307/2311857openalex-snapshot
On Certain Nonlinear Recurring Sequences
inferredcites →https://doi.org/10.5555/127787.127846openalex-snapshot
Bounded space on-line bin packing: best is better than first

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4647288openalex-extracted
Overflowing Bin Packing Problem: The Preservation of Digital Documents in Archival Information Packages
inferred← citeshttps://doi.org/10.1002/cpe.3166openalex-snapshot
CloudMon: a resource‐efficient IaaS cloud monitoring system based on networked intrusion detection system virtual appliances
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_59openalex-snapshot
On-Line Algorithms for Cardinality Constrained Bin Packing Problems
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_12openalex-snapshot
A new exact algorithm for general orthogonal d-dimensional knapsack problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_49openalex-snapshot
Bin Packing
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_35openalex-snapshot
Bin Packing Approximation Algorithms: Survey and Classification
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_3openalex-snapshot
Bin Packing Approximation Algorithms: Combinatorial Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_49openalex-snapshot
Bin Packing
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_27openalex-snapshot
Sparse Approximation in Lattices and Semigroups
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_3openalex-snapshot
NF-Based Algorithms for Online Bin Packing with Buffer and Item Size Limitation
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_2openalex-snapshot
Sequential Vector Packing
inferred← citeshttps://doi.org/10.1007/978-3-642-20009-0_102openalex-snapshot
Online Optimization: Probabilistic Analysis and Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-58409-1_2openalex-snapshot
Combinatorial Online Optimization
inferred← citeshttps://doi.org/10.1007/978-981-19-0901-6_30openalex-snapshot
PhyMCons: Physical Machine Consolidation for Minimizing VM Migration and Energy Consumption in Fog Center
inferred← citeshttps://doi.org/10.1007/bf02009554openalex-snapshot
Tight performance bound ofAFB k bin packing
inferred← citeshttps://doi.org/10.1007/bfb0029570openalex-snapshot
On-line scheduling
inferred← citeshttps://doi.org/10.1007/s00453-012-9713-8openalex-snapshot
Online Square Packing with Gravity
inferred← citeshttps://doi.org/10.1007/s10100-022-00798-1openalex-snapshot
The bin covering with delivery problem, extended investigations for the online case
inferred← citeshttps://doi.org/10.1007/s10107-026-02340-6openalex-snapshot
Sparse approximation in lattices and semigroups
inferred← citeshttps://doi.org/10.1007/s10729-015-9318-2openalex-snapshot
Improving operating room schedules
inferred← citeshttps://doi.org/10.1007/s10878-014-9771-8openalex-snapshot
NF-based algorithms for online bin packing with buffer and bounded item size
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2013.10.012openalex-snapshot
Algorithms for scheduling of chemotherapy plans
inferred← citeshttps://doi.org/10.1016/j.cosrev.2016.12.001openalex-snapshot
Approximation and online algorithms for multidimensional bin packing: A survey
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.01.051openalex-snapshot
Tighter bounds for the harmonic bin packing algorithm
inferred← citeshttps://doi.org/10.1016/j.orl.2012.10.006openalex-snapshot
Online bin packing with delay and holding costs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.027openalex-snapshot
Sequential vector packing
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00018-2openalex-snapshot
A new version of on-line variable-sized bin packing
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00118-9openalex-snapshot
A bin packing problem with over-sized items
inferred← citeshttps://doi.org/10.1023/a:1004953109743openalex-snapshot
On-Line Packing Sequences of Cubes in the Unit Cube
inferred← citeshttps://doi.org/10.1023/a:1018947117526openalex-snapshot
Cardinality constrained bin‐packing problems
inferred← citeshttps://doi.org/10.1080/00207543.2026.2626535openalex-snapshot
A dynamic plate design problem via reinforcement learning
inferred← citeshttps://doi.org/10.1097/00000539-199907000-00003openalex-snapshot
An Operating Room Scheduling Strategy to Maximize the Use of Operating Room Block Time
inferred← citeshttps://doi.org/10.1097/00000539-200004000-00038openalex-snapshot
Scheduling Surgical Cases into Overflow Block Time— Computer Simulation of the Effects of Scheduling Strategies on Operating Room Labor Costs
inferred← citeshttps://doi.org/10.1097/00000542-199911000-00043openalex-snapshot
Which Algorithm for Scheduling Add-on Elective Cases Maximizes Operating Room Utilization?
inferred← citeshttps://doi.org/10.1109/netgames.2014.7008968openalex-snapshot
Let's depart together: Efficient play request dispatching in cloud gaming
inferred← citeshttps://doi.org/10.1109/tc.2012.284openalex-snapshot
Automatic Scaling of Internet Applications for Cloud Computing Services
inferred← citeshttps://doi.org/10.1109/tc.2013.148openalex-snapshot
Adaptive Resource Provisioning for the Cloud Using Online Bin Packing
inferred← citeshttps://doi.org/10.1109/tcsvt.2015.2450152openalex-snapshot
Play Request Dispatching for Efficient Virtual Machine Usage in Cloud Gaming
inferred← citeshttps://doi.org/10.1109/tpds.2015.2393868openalex-snapshot
Dynamic Bin Packing for On-Demand Cloud Resource Allocation
inferred← citeshttps://doi.org/10.1109/tpds.2019.2948327openalex-snapshot
On Fault-Tolerant Bin Packing for Online Resource Allocation
inferred← citeshttps://doi.org/10.1111/itor.13318openalex-snapshot
Cutting and packing problems under uncertainty: literature review and classification framework
inferred← citeshttps://doi.org/10.1137/1.9781611974782.66openalex-snapshot
Online Lower Bounds via Duality
inferred← citeshttps://doi.org/10.1137/1.9781611975031.63openalex-snapshot
Randomized Algorithms for Online Vector Load Balancing
inferred← citeshttps://doi.org/10.1145/2488608.2488730openalex-snapshot
Tight bounds for online vector bin packing
inferred← citeshttps://doi.org/10.1145/2516821.2516822openalex-snapshot
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation
inferred← citeshttps://doi.org/10.1145/2594538.2594548openalex-snapshot
Cost-oblivious storage reallocation
inferred← citeshttps://doi.org/10.1145/2612669.2612675openalex-snapshot
On dynamic bin packing for resource allocation in the cloud
inferred← citeshttps://doi.org/10.1145/2905055.2905071openalex-snapshot
Energy Aware Heuristic Scheduling of Variable Class Constraint Resources in Cloud Data Centres
inferred← citeshttps://doi.org/10.1145/3070693openalex-snapshot
Cost-Oblivious Storage Reallocation
inferred← citeshttps://doi.org/10.1145/3087556.3087596openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1213/ane.0b013e3182841226openalex-snapshot
A Behavioral Study of Daily Mean Turnover Times and First Case of the Day Start Tardiness
inferred← citeshttps://doi.org/10.1287/opre.47.6.889openalex-snapshot
Price-Directed Control of Remnant Inventory Systems
inferred← citeshttps://doi.org/10.3990/1.9789036527538openalex-snapshot
Online scheduling and project scheduling
inferred← citeshttps://doi.org/10.4103/0256-4602.81230openalex-snapshot
Sercon: Server Consolidation Algorithm using Live Migration of Virtual Machines for Green Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1316openalex-snapshot
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation
inferred← citeshttps://doi.org/10.48550/arxiv.1404.2019openalex-snapshot
Cost-oblivious storage reallocation
inferred← citeshttps://doi.org/10.5555/2755535.2755537openalex-snapshot
Let's depart together: efficient play request dispatching in cloud gaming
inferred← citeshttps://doi.org/10.70675/4be92895zfa7fz4d60zae17z568483817e73openalex-snapshot
Integrating a business process analysis and optimization step using BPMN model in a general process design and development approach : application to a paperless mail flow process
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.