Related papers: Pseudopolynomial algorithm for single machine sche…
This paper has been withdrawn by the author due to an error in the main proof (thanks to Carlos D'Andrea)
This paper was withdrawn by the author because severe errors were discovered.
We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…
This paper has been withdrawn by the author.
This paper has been withdrawn by the author.
This paper has been withdrawn by the author.
Withdrawn by the authors due to an error in the proof of the finite field result (Thm. 1.5): The random primes used in the proof need NOT avoid the exceptional primes from Lemma 2.7, thus leaving Thm. 1.5 unproved.
Nowadays hybrid evolutionary algorithms, i.e, heuristic search algorithms combining several mutation operators some of which are meant to implement stochastically a well known technique designed for the specific problem in question while…
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time between consecutive occurrences of the same edge. This NP-hard…
The methods used to prove the main result must be incorrect, as they can be used to arrive at a contradiction with previously known results. Thus the paper was withdrawn.
This submission has been withdrawn by the authors because it is a duplicate of arXiv:hep-ph/0611336. It was due to a technical submission error by the authors.
This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.
There is a technical issue in the analysis that is not easily fixable. We, therefore, withdraw the submission. Sorry for the inconvenience.
This paper has been withdrawn
This paper has been withdrawn because Proposition 2.2 (c) is false. This invalids the main results of section 2 and 3. We thank A. Canonaco for pointing us the error.
We study the problem of scheduling jobs on parallel machines minimizing the total completion time, with each job using exactly one resource. First, we derive fundamental properties of the problem and show that the problem is polynomially…
This paper has been withdrawn by the author due to a sheaf-theoretic error, in the end of the proof of the main theorem.
Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.
This paper considers the problem of scheduling jobs on single and parallel machines where all the jobs possess different processing times but a common due date. There is a penalty involved with each job if it is processed earlier or later…
This paper has been withdrawn due to an error in the proof of the main theorem.