On uniform k-partition problems

Discrete Applied Mathematics

Volumn 150, Issue 1-3, 2005, Pages 121-139

  Dell'Olmo, Paolo ^a   Hansen, Pierre ^b   Pallottino, Stefano ^c   Storchi, Giovanni ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Algorithms; Complexity; Matrix permutation; Partition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SCHEDULING; SET THEORY;

MATRIX PERMUTATION; PARTITION;

PROBLEM SOLVING;

EID: 23944473116     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.02.013     Document Type: Article

References (10)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows 1993 Prentice-Hall Englewood Cliffs, NJ
2. 1.5 √m / log n) Inform. Process. Lett. 37 1991 237 240
3. J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt, and J. Weglarz Scheduling Computer and Manufacturing Processes 1996 Springer Berlin
4. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan Time bounds for selection J. Comput. System Sci. 7 1973 448 461
5. R.E. Burkard Selected topics on assignment problems Discrete Appl. Math. 123 2002 257 302
6. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
7. P. Hansen, Bicriterion Path Problems, in: Multiple Criteria Decision Making: Theory and Applications, Lecture Notes in Economics and Mathematical Systems, vol. 177, 1980, pp. 109-127.
8. P. Hansen, G. Storchi, and T. Vovor Paths with minimum range and ratio of arc lengths Discrete Appl. Math. 78 1997 1 3, 89-102
9. S. Martello, W.R. Pulleyblank, P. Toth, and D. de Werra Balanced optimization problems Oper. Res. Lett. 3 1984 275 278
10. A.P. Punnen, and K.P.K. Nair Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem Discrete Appl. Math. 55 1994 91 93