2017
|
|
Jonad Pulaj
|
Cutting Planes for Union-Closed Families
|
Doctoral thesis, Technische Universität Berlin, Martin Grötschel, Ralf Borndörfer (Advisors), 2017 |
BibTeX
|
| Fabio D'Andreagiovanni, Fabian Mett, Antonella Nardin, Jonad Pulaj |
Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks
|
Applied Soft Computing, Vol.61, pp. 1074-1087, 2017 |
BibTeX
DOI
|
2016
|
|
Jonad Pulaj
|
Cutting Planes for Families Implying Frankl's Conjecture
|
2016 (under review, preprint available as ZIB-Report 16-51) |
PDF (ZIB-Report)
PDF (ZIB-Report)
BibTeX
|
2015
|
| Fabio D'Andreagiovanni, Fabian Mett, Jonad Pulaj |
An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
|
ZIB-Report 15-62 (Applications of Evolutionary Computation, LNCS 9597, pp. 283-298) |
PDF
BibTeX
URN
DOI
|
| Jonad Pulaj, Annie Raymond, Dirk Theis |
New Conjectures For Union-Closed Families
|
ZIB-Report 15-57 |
PDF
BibTeX
URN
|
2014
|
| Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj |
A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods
|
Applied Soft Computing, Vol.26, pp. 497-507, 2014 (preprint available as ZIB-Report 14-40) |
PDF (ZIB-Report)
BibTeX
DOI
|
2013
|
| Fabio D'Andreagiovanni, Jonatan Krolikowski, Jonad Pulaj |
A hybrid primal heuristic for Robust Multiperiod Network Design
|
ZIB-Report 13-78 (To appear in EvoApplications - Proc. of EvoStar 2014, Esparcia-Alcazar, A. et al. (Eds.), Lecture Notes in Computer Science, Springer, Heidelberg) |
PDF
BibTeX
URN
|
2011
|
| Anastasios Giovanidis, Jonad Pulaj |
The Multiperiod Network Design Problem: Lagrangian-based Solution Approaches
|
ZIB-Report 11-31 |
PDF
BibTeX
URN
|
zib.de