The following pages link to Gábor Galambos (Q406639):
Displaying 44 items.
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- (Q580977) (redirect page) (← links)
- Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem (Q580978) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- Improved analysis of an algorithm for the coupled task problem with UET jobs (Q1015304) (← links)
- An O(n) bin-packing algorithm for uniformly distributed data (Q1065544) (← links)
- A probabilistic analysis of the next fit decreasing bin packing heuristic (Q1085074) (← links)
- Repacking helps in bounded space on-line bin-packing (Q1207048) (← links)
- A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477) (← links)
- Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349) (← links)
- Analysis of permutation routing algorithms (Q1580969) (← links)
- Worst-case analysis of the iterated longest fragment algorithm (Q1603464) (← links)
- Tight bounds for NF-based bounded-space online bin packing algorithms (Q1702819) (← links)
- Lower bound for 3-batched bin packing (Q1751161) (← links)
- An exact algorithm for scheduling identical coupled tasks (Q1762669) (← links)
- The fractional greedy algorithm for data compression (Q1906680) (← links)
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Operations research in Hungary: VOCAL 2018 (Q2045605) (← links)
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays (Q2060394) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- (Q2834257) (← links)
- (Q2909025) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- (Q3145801) (← links)
- Probabilistic analysis of algorithms for dual bin packing problems (Q3361889) (← links)
- (Q3428831) (← links)
- (Q3483093) (← links)
- Lower Bound for the Online Bin Packing Problem with Restricted Repacking (Q3614164) (← links)
- (Q3691401) (← links)
- Parametric Lower Bound for On-Line Bin-Packing (Q3724089) (← links)
- (Q3736905) (← links)
- (Q3787789) (← links)
- (Q3840319) (← links)
- (Q3988808) (← links)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling (Q4032943) (← links)
- (Q4291430) (← links)
- A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling" (Q4337646) (← links)
- Greedy Algorithms for On-Line Data Compression (Q4373003) (← links)
- Minimizing the weighted number of late jobs in UET open shops (Q4698122) (← links)
- (Q4728248) (← links)
- (Q4836291) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← links)
- (Q5422515) (← links)
