Eranda Dragoti-Çela

Graz University of Technology

Department of Optimization and Discrete Mathematics Publications

For most of the papers click on the title to obtain a (compressed) postscript or a pdf file of a first complete version (technical-report)

• Monograph:
  

  The quadratic assignment problem: Theory and algorithms,
  Kluwer Academic Publishers, 1998, Dordrecht, The Netherlands.

• Publications in international reviewed journals:
  
  • Heuristics for Biquadratic Assignment Problems and their Computational Comparison ,
    with R.E. Burkard,
    European Journal of Operational Research 83, 1995, 283-300.
  • A Minimax Assignment Problem in Treelike Communication Networks,
    with R.E.Burkard and G.J. Woeginger,
    European Journal of Operational Research 87, 1995, 670-684.
  • Hamiltonian Cycles in Circulant Digraphs with Two Stripes,
    with R.E. Burkard, G.J. Woeginger, and Q.F. Yang,
    Discrete Mathematics 176, 1997, 233-254.
  • The Quadratic Assignment Problem with a Monotone Anti-Monge Matrix and a Symmetric Toeplitz Matrix: Easy and Hard Cases,
    with R.E. Burkard, G. Rote, and G.J. Woeginger,
    Mathematical Programming (Series B), 82, 1998, 125-158.
  • A Unified Approach to Simple Special Cases of Extremal Permutation Problems ,
    with R.E. Burkard, V. M. Demidenko, N.N. Metelski, and G.J. Woeginger,
    Optimization 44, 1998, 123-138.
  • Stochastic Algorithms in Electromagnetic Optimizations,
    with G. Alotto, B. Brandstätter, G. Fürntratt, Ch. Magele, G. Molinari, M. Nervi, K. Preis, M. Repetto und K. Richter,
    IEEE Transactions on Magnetics 34, 1998, 3674-3684.
  • A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization,
    with S.E. Karisch, J. Clausen, and T. Espersen,
    Computing 63, 1999, 351-403.
  • 2-Medians in trees with pos/neg  weights ,
    with R.E. Burkard and H. Dollani,
    Discrete Applied Mathematics, 105, 2000, 51-71.
  • An asymptotical study of combinatorial optimization problems by means of statistical mechanics,
    with H. Albrecher and R.E. Burkard,
    Journal of Computational and Applied Mathematics, 186(1), 2006, 148-162.
  • Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem,
    with B. Klinz and Ch. Meyer,
    Journal of Combinatorial Optiomization, 12(3), 2006, 187-215.
  • The Wiener maximum quadratic assignment problem,
    with N.S. Schmuck, S. Wimer and G.J. Woeginger, Discrete Optimization 8(3), 2011, 411-416.
• Publications as book chapters or articles in conference proceedings:
  
  • On the Biquadratic Assignment Problem,
    with R.E. Burkard and B. Klinz,
    in Quadratic Assignment and Related Problems,
    Proceedings of the DIMACS Workshop on Quadratic Assignment Problems,
    P. Pardalos and H. Wolkowitz, eds.,
    DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1994, 117-146.
  • A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior ,
    with R.E. Burkard and T. Dudas,
    in Network Optimization, P.M. Pardalos, D.W. Hearn, and W.W. Hager, eds.,
    Lecture Notes in Economics and Mathematical Systems 450, 1997, 127-156.
  • Quadratic and Three-Dimensional Assignments: An Annotated Bibliography,
    with R.E. Burkard,
    in Annotated Bibliographies in Combinatorial Optimization,
    M. Dell'Amico, F. Maffioli and S.Martello, eds.,
    Wiley, Chichester, 1997, pp. 373-392.
  • The Quadratic Assignment Problem,
    with R.E. Burkard, P.M. Pardalos, and L.S. Pitsoulis,
    Handbook of Combinatorial Optimization, P.M. Pardalos and D.-Z. Du, eds.,
    Kluwer Academic Publishers,1998, pp. 241-338.
  • Linear Assignment Problems and Extensions,
    with R.E. Burkard,
    Handbook of Combinatorial Optimization - Supplement Volume A,
    P.M. Pardalos and D.-Z. Du, eds.,
    Kluwer Academic Publishers, 1999, pp. 75-149.
  • Assignment Problems,
    Handbook of Applied Optimization, Part II - Applications,
    P.M. Pardalos and M. Resende, eds.,
    Oxford University Press, 2002, pp. 661-678.
• Submitted for publication:
  
  • On x-and-y axes travelling salesman problem,,
    with V. Deineko und G.J. Woeginger.
  • A branch and bound algorithm for the planar 3-index bottleneck assignment problem,
    with R.E. Burkard and S. Maneechai.
• Diploma, doctoral and habilitation thesis:
  
  • Diploma Thesis:
    Complexity comparison and analysis of recent algorithms for network flows (1992), in Albanian.
  • PhD Thesis:
    The Quadratic Assignment Problem: Special Cases and Relatives (1995).
  • Habilitation Thesis:
    NP-hard location problems: efficiently solvable special cases and lower bounds (2001).

---

cela@opt.math.tu-graz.ac.at.

Back to my homepage

Last Update: August 2011

---