The following pages link to János Balogh (Q301111):
Displaying 36 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- New lower bounds for certain classes of bin packing algorithms (Q441876) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Lower bound for 3-batched bin packing (Q1751161) (← links)
- Some global optimization problems on Stiefel manifolds (Q1768631) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- Guillotine cutting is asymptotically optimal for packing consecutive squares (Q2091225) (← links)
- Lower bounds for batched bin packing (Q2125232) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Online bin packing with cardinality constraints resolved (Q2186811) (← links)
- Lower bounds for online bin covering-type problems (Q2304119) (← links)
- Online results for black and white bin packing (Q2344213) (← links)
- Offline black and white bin packing (Q2355707) (← links)
- Bin packing problem with scenarios (Q2418155) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- Global optimization on Stiefel manifolds: a computational approach (Q2493237) (← links)
- (Q2834257) (← links)
- Black and White Bin Packing (Q2848920) (← links)
- (Q2909025) (← links)
- New Lower Bounds for Certain Classes of Bin Packing Algorithms (Q3075446) (← links)
- On the heapability of finite partial orders (Q3386613) (← links)
- (Q3428839) (← links)
- Lower Bound for the Online Bin Packing Problem with Restricted Repacking (Q3614164) (← 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)
- The basic problem of vehicle scheduling can be solved by maximum bipartite matching (Q5369827) (← links)
- Driver scheduling for vehicle schedules using a set covering approach: a case study (Q5369828) (← links)
- (Q5422515) (← 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)
- (Q6090878) (← links)
- A new and improved algorithm for online bin packing (Q6288699) (← links)
