Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Zsolt Tuza
Information about the author Zsolt Tuza will soon be added to the site.
Found
9 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Improved bounds for batch scheduling with nonidentical job sizes
2014
Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on...
Colorability of mixed hypergraphs and their chromatic inversions
2013
We solve a long‐standing open problem concerning a discrete mathematical model,...
Two uniform machines with nearly equal speeds: unified approach to known sum and known optimum in semi on‐line scheduling
2011
We consider semi on‐line scheduling on two uniform machines. The speed of the...
Semi on-line scheduling on three processors with known sum of the tasks
2007
We consider a semi on-line version of the multiprocessor scheduling problem on three...
Semi on-line algorithms for the partition problem
1997
The partition problem is one of the basic NP-complete problems. While an efficient...
Optimal routings in communications networks with linearly bounded forwarding index
1996
In a given graph with n vertices, a routing is defined as a set of n ( n – 1)...
Uncolorable mixed hypergraphs
2000
A mixed hypergraph H = ( X ,A,E ) consists of the vertex set X and two families of...
The expected relative error of the polyhedral approximation of the max-cut problem
1994
The authors study the expected relative error of a linear relaxation of the max-cut...
Narrowness, pathwidth, and their application in natural language processing
1992
In the syntactic theory of Tesnière the structural description of sentences are...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers