Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming

DOI10.1051/ITA:2007032MaRDI QIDQ3515460zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maria Serna, Fatos Xhafa

Publication date 29 July 2008

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92869

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Quadratic programming (90C20)

Recommendations

• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
• scientific article; zbMATH DE number 2185607
• On the parallel approximability of a subclass of quadratic programming.
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem
• scientific article; zbMATH DE number 1760037

Cites work

• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• A parallel approximation algorithm for positive linear programming
• Approximating linear programming is log-space complete for P
• scientific article; zbMATH DE number 3972625 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263204 (Why is no real title available?)
• scientific article; zbMATH DE number 1163714 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Improved parallel approximation of a class of integer programming problems
• On the parallel approximability of a subclass of quadratic programming.
• Parallel approximation algorithms by positive linear programming
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Pseudorandomness and Combinatorial Constructions
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• The approximability of non-Boolean satisfiability problems and restricted integer programming
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines

Cited in

(3)

• On the parallel approximability of a subclass of quadratic programming.
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem

This page was built for publication: Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3515460)