Domination analysis for minimum multiprocessor scheduling
From MaRDI portal
Publication:858313
DOI10.1016/j.dam.2006.02.010zbMath1275.90025OpenAlexW2131489563MaRDI QIDQ858313
Anders Yeo, Gregory Gutin, Tommy R. Jensen
Publication date: 9 January 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.02.010
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (3)
The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transformations of generalized ATSP into ATSP.
- Domination analysis of combinatorial optimization problems.
- Domination analysis of greedy heuristics for the frequency assignment problem.
- TSP heuristics: domination analysis and complexity
- Domination analysis of some heuristics for the traveling salesman problem
- Anti-matroids
- A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains
- A Remark on Stirling's Formula
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Balls and bins: A study in negative dependence
- Algorithms with large domination ratio
- An inequality involving multinomial probabilities
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
This page was built for publication: Domination analysis for minimum multiprocessor scheduling
