Eranda Çela

37 papers B 3C 1Journal 31Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
A linear time algorithm for linearizing quadratic and higher-order shortest path problems.
Math. Program.
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2025 J jnl
Integrating multiple sources of ordinal information in portfolio optimization.
Ann. Oper. Res.
Eranda Çela, Stephan Hafner, Roland Mestel, Ulrich Pferschy
2024 J jnl
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty.
Networks
Corinna Mathwieser, Eranda Çela
2024 J jnl
Travelling salesman paths on Demidenko matrices.
Discret. Appl. Math.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023 B conf
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.
IPCO
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023 J jnl
A linear time algorithm for linearizing quadratic and higher-order shortest path problems.
CoRR
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger, Lasse Wulf
2023 J jnl
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid.
Discret. Appl. Math.
Eranda Çela, Elisabeth Gaar
2023 J jnl
Recognising permuted Demidenko matrices.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2023 J jnl
Recognising permuted Demidenko matrices.
Oper. Res. Lett.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2022 J jnl
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl.
Eranda Çela, Elisabeth Gaar
2022 J jnl
Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty.
CoRR
Corinna Mathwieser, Eranda Çela
2021 J jnl
A machine learning-based branch and price algorithm for a sampled vehicle routing problem.
OR Spectr.
Nikolaus Furian, Michael J. O'Sullivan, Cameron G. Walker, Eranda Çela
2021 B conf
Linearizable Special Cases of the Quadratic Shortest Path Problem.
WG
Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf
2020 J jnl
Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid.
CoRR
Eranda Çela, Elisabeth Gaar
2020 J jnl
Travelling salesman paths on Demidenko matrices.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2019 J jnl
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid.
CoRR
Eranda Çela, Elisabeth Gaar
2018 J jnl
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices.
Eur. J. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2017 J jnl
The multi-stripe travelling salesman problem.
Ann. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016 J jnl
Linearizable special cases of the QAP.
J. Comb. Optim.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2016 J jnl
The multi-stripe travelling salesman problem.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2015 C conf
A New Tractable Case of the QAP with a Robinson Matrix.
COCOA
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2015 J jnl
Heuristics for the data arrangement problem on regular trees.
J. Comb. Optim.
Eranda Çela, Rostislav Stanek
2015 J jnl
Well-solvable cases of the QAP with block-structured matrices.
Discret. Appl. Math.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2014 J jnl
Linearizable special cases of the QAP.
CoRR
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2013 J jnl
Heuristics for the data arrangement problem on regular trees
CoRR
Eranda Çela, Rostislav Stanek
2012 J jnl
Another well-solvable case of the QAP: Maximizing the job completion time variance.
Oper. Res. Lett.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2012 J jnl
The x-and-y-axes travelling salesman problem.
Eur. J. Oper. Res.
Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
2011 J jnl
The Wiener maximum quadratic assignment problem.
Discret. Optim.
Eranda Çela, Nina S. Schmuck, Shmuel Wimer, Gerhard J. Woeginger
2006 J jnl
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.
J. Comb. Optim.
Eranda Çela, Bettina Klinz, Christophe Meyer
2000 J jnl
2-Medians in trees with pos/neg weights.
Discret. Appl. Math.
Rainer E. Burkard, Eranda Çela, Helidon Dollani
1999 J jnl
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization.
Computing
Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen
1999 — ch.
Linear Assignment Problems and Extensions.
Handbook of Combinatorial Optimization
Rainer E. Burkard, Eranda Çela
1998 J jnl
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program.
Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1997 J jnl
Book reviews.
Math. Methods Oper. Res.
Eranda Çela, Hans Achatz
1997 J jnl
Hamiltonian cycles in circulant digraphs with two stripes.
Discret. Math.
Qi Fan Yang, Rainer E. Burkard, Eranda Çela, Gerhard J. Woeginger
1996 B conf
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases.
IPCO
Rainer E. Burkard, Eranda Çela, Günter Rote, Gerhard J. Woeginger
1993 — conf
On the Biquadratic Assignment Problem.
Quadratic Assignment and Related Problems
Rainer E. Burkard, Eranda Çela, Bettina Klinz