scientific article; zbMATH DE number 2086932
From MaRDI portal
Publication:4737537
zbMath1049.90025MaRDI QIDQ4737537
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370329.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Scheduling with an orthogonal resource constraint
This page was built for publication:
