The following pages link to József Békési (Q301112):
Displaying 43 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← 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)
- Analysis of permutation routing algorithms (Q1580969) (← links)
- (Q1603463) (redirect page) (← 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)
- The optimal absolute ratio for online bin packing (Q1741486) (← 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)
- A first fit type algorithm for the coupled task scheduling problem with unit execution time and two exact delays (Q2060394) (← links)
- Lower bounds for batched bin packing (Q2125232) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- Bounds for online bin packing with cardinality constraints (Q2629856) (← links)
- (Q2834257) (← links)
- Black and White Bin Packing (Q2848920) (← links)
- (Q2909025) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- (Q3428831) (← links)
- Lower Bound for the Online Bin Packing Problem with Restricted Repacking (Q3614164) (← links)
- (Q3840319) (← links)
- Greedy Algorithms for On-Line Data Compression (Q4373003) (← links)
- Regional Multicriteria and Multimodal Route Planning System for Public Transportation: A Case Study (Q4584651) (← links)
- Integrated Vehicle Scheduling and Vehicle Assignment (Q4584652) (← links)
- (Q4836291) (← links)
- (Q5009562) (← links)
- (Q5111695) (← links)
- Driver scheduling based on “driver-friendly” vehicle schedules (Q5176323) (← links)
- The optimal absolute ratio for online bin packing (Q5363009) (← links)
- Driver scheduling for vehicle schedules using a set covering approach: a case study (Q5369828) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)
- A new lower bound for classic online bin packing (Q5918310) (← links)
- A new lower bound for classic online bin packing (Q5918895) (← links)
- Joint replenishment meets scheduling (Q6102849) (← links)
- A new and improved algorithm for online bin packing (Q6288699) (← links)