Lorant Porkolab

Available identifiers

zbMath Open porkolab.lorantMaRDI QIDQ490288

List of research outcomes

Publication	Date of Publication	Type
Improved approximation schemes for scheduling unrelated parallel machines	2016-09-29	Paper
Preemptive scheduling with dedicated processors: applications of fractional graph coloring	2015-01-22	Paper
Preemptive scheduling with dedicated processors: applications of fractional graph coloring	2007-12-20	Paper
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes	2007-09-06	Paper
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time	2006-06-01	Paper
Improved Approximation Schemes for Scheduling Unrelated Parallel Machines	2005-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3024769	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4737537	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4472514	2004-08-04	Paper
Computing optimal preemptive schedules for parallel tasks: linear programming approaches	2003-07-13	Paper
Polynomial time approximation schemes for general multiprocessor job shop scheduling	2003-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q4782744	2002-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4536380	2002-11-04	Paper
https://portal.mardi4nfdi.de/entity/Q4535069	2002-06-12	Paper
Linear-Time approximation schemes for scheduling malleable parallel tasks	2002-05-21	Paper
https://portal.mardi4nfdi.de/entity/Q2754204	2001-12-06	Paper
Approximate max-min resource sharing for structured concave optimization	2001-06-21	Paper
Integer optimization on convex semialgebraic sets	2000-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4362249	2000-01-23	Paper
https://portal.mardi4nfdi.de/entity/Q4252325	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4400635	1998-08-02	Paper
On the complexity of semidefinite programs	1997-07-23	Paper

Research outcomes over time

This page was built for person: Lorant Porkolab