János Balogh

From MaRDI portal
Revision as of 17:49, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:301111

Available identifiers

zbMath Open balogh.janosMaRDI QIDQ301111

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q60908782023-11-20Paper
Guillotine cutting is asymptotically optimal for packing consecutive squares2022-11-01Paper
Lower bounds on the performance of online algorithms for relaxed packing problems2022-08-30Paper
Lower bounds for batched bin packing2022-04-13Paper
Lower bounds on the performance of online algorithms for relaxed packing problems2022-01-16Paper
More on ordered open end bin packing2022-01-14Paper
https://portal.mardi4nfdi.de/entity/Q50095622021-08-04Paper
A new lower bound for classic online bin packing2021-06-30Paper
On the heapability of finite partial orders2021-01-05Paper
A new lower bound for classic online bin packing2020-08-24Paper
Online bin packing with cardinality constraints resolved2020-06-09Paper
https://portal.mardi4nfdi.de/entity/Q51116952020-05-27Paper
Lower bounds for online bin covering-type problems2020-03-06Paper
Lower bounds for several online variants of bin packing2019-12-19Paper
Bin packing problem with scenarios2019-06-03Paper
The optimal absolute ratio for online bin packing2019-05-03Paper
Lower bounds for several online variants of bin packing2018-06-22Paper
Lower bound for 3-batched bin packing2018-05-24Paper
The basic problem of vehicle scheduling can be solved by maximum bipartite matching2017-10-19Paper
Driver scheduling for vehicle schedules using a set covering approach: a case study2017-10-19Paper
The optimal absolute ratio for online bin packing2017-10-05Paper
A new and improved algorithm for online bin packing2017-07-06Paper
https://portal.mardi4nfdi.de/entity/Q28342572016-11-25Paper
Semi-on-line bin packing: a short overview and a new lower bound2016-06-29Paper
Offline black and white bin packing2015-07-24Paper
Online results for black and white bin packing2015-05-12Paper
Driver scheduling based on “driver-friendly” vehicle schedules2015-03-03Paper
On-line bin packing with restricted repacking2014-02-25Paper
Black and White Bin Packing2013-09-13Paper
https://portal.mardi4nfdi.de/entity/Q29090252012-08-29Paper
New lower bounds for certain classes of bin packing algorithms2012-08-08Paper
New Lower Bounds for Certain Classes of Bin Packing Algorithms2011-02-15Paper
Improved lower bounds for semi-online bin packing problems2009-04-27Paper
Lower Bound for the Online Bin Packing Problem with Restricted Repacking2009-03-16Paper
https://portal.mardi4nfdi.de/entity/Q54225152007-10-26Paper
https://portal.mardi4nfdi.de/entity/Q34288392007-03-29Paper
Global optimization on Stiefel manifolds: a computational approach2006-06-12Paper
Some global optimization problems on Stiefel manifolds2005-03-15Paper

Research outcomes over time

This page was built for person: János Balogh