The following pages link to Lorant Porkolab (Q490288):
Displaying 23 items.
- (Q1348948) (redirect page) (← links)
- Linear-Time approximation schemes for scheduling malleable parallel tasks (Q1348949) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches (Q1396837) (← links)
- Integer optimization on convex semialgebraic sets (Q1971505) (← links)
- Approximate Max-Min Resource Sharing for Structured Concave Optimization (Q2719242) (← links)
- (Q2754204) (← links)
- Improved approximation schemes for scheduling unrelated parallel machines (Q2819574) (← links)
- (Q3024769) (← links)
- (Q4252325) (← links)
- (Q4362249) (← links)
- (Q4400635) (← links)
- (Q4472514) (← links)
- (Q4535069) (← links)
- (Q4536380) (← links)
- (Q4737537) (← links)
- (Q4782744) (← links)
- Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605) (← links)
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time (Q5470701) (← links)
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines (Q5704042) (← links)
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes (Q5757371) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5892097) (← links)
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring (Q5920389) (← links)
