scientific article; zbMATH DE number 1305477
From MaRDI portal
Publication:4252365
zbMath0929.65034MaRDI QIDQ4252365
Publication date: 11 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (13)
Approximating multidimensional subset sum and Minkowski decomposition of polygons ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ Polynomial time approximation schemes and parameterized complexity ⋮ Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ Approximation algorithms for extensible bin packing ⋮ A theory and algorithms for combinatorial reoptimization ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ On-line scheduling with extendable working time on a small number of machines ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness ⋮ A PTAS for the average weighted completion time problem on unrelated machines.
This page was built for publication:
