Domination analysis for minimum multiprocessor scheduling
type: Item
instance of: scholarly article
title: Domination analysis for minimum multiprocessor scheduling
zbMATH Open document ID: 1275.90025
author: G. Gutin
author: A. Yeo
author: T. R. Jensen
published in: Discrete Applied Mathematics
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5082765
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: domination analysis
zbMATH Keywords: minimum multiprocessor scheduling
MaRDI profile type: Publication
full work available at URL: j.dam.2006.02.010
OpenAlex ID: W2131489563
cites work: Q4773298
cites work: Algorithms with large domination ratio
cites work: Q4258216
cites work: A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
cites work: Transformations of generalized ATSP into ATSP.
cites work: Q3576755
cites work: Balls and bins: A study in negative dependence
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: Domination analysis of combinatorial optimization problems.
cites work: Anti-matroids
cites work: Q3374248
cites work: Q4461908
cites work: Q4461912
cites work: Domination analysis of greedy heuristics for the frequency assignment problem.
cites work: An inequality involving multinomial probabilities
cites work: Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
cites work: Domination analysis of some heuristics for the traveling salesman problem
cites work: TSP heuristics: domination analysis and complexity
cites work: A Remark on Stirling's Formula
cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
DOI: 10.1016/J.DAM.2006.02.010
description: scientific article; zbMATH DE number 5082765