A faster fully polynomial approximation scheme for the single-machine total tardiness problem (Q958114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976596296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the complexities of approximation algorithms for optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the decomposition properties of the single machine total tardiness problem / rank
 
Normal rank

Revision as of 20:54, 28 June 2024

scientific article
Language Label Description Also known as
English
A faster fully polynomial approximation scheme for the single-machine total tardiness problem
scientific article

    Statements

    Identifiers