Eranda Çela
Orcid: 0000-0002-5099-8804
According to our database1,
Eranda Çela
authored at least 26 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty.
Networks, April, 2024
2023
Discret. Appl. Math., May, 2023
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
2022
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid.
J. Graph Algorithms Appl., 2022
2021
A machine learning-based branch and price algorithm for a sampled vehicle routing problem.
OR Spectr., 2021
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021
2020
Relationship of k-Bend and Monotonic 𝓁-Bend Edge Intersection Graphs of Paths on a Grid.
CoRR, 2020
2018
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices.
Eur. J. Oper. Res., 2018
2017
2016
2015
Discret. Appl. Math., 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2012
Oper. Res. Lett., 2012
2011
2006
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem.
J. Comb. Optim., 2006
2000
1999
A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization.
Computing, 1999
Proceedings of the Handbook of Combinatorial Optimization, 1999
1998
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases.
Math. Program., 1998
1997
1993
Proceedings of the Quadratic Assignment and Related Problems, 1993