Jonad Pulaj

Orcid: 0000-0002-5741-7187

According to our database1, Jonad Pulaj authored at least 15 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Expiring Assets in Automated Market Makers.
CoRR, 2024

2023
Characterizing 3-Sets in Union-Closed Families.
Exp. Math., April, 2023

Automating Weight Function Generation in Graph Pebbling.
CoRR, 2023

Verifying MILP Certificates with SMT Solvers.
CoRR, 2023

2022
A Safe Computational Framework for Integer Programming Applied to Chvátal's Conjecture.
ACM Trans. Math. Softw., 2022

Using skip graphs for increased NUMA locality.
J. Parallel Distributed Comput., 2022

2021
On the Linear Ordering Problem and the Rankability of Data.
CoRR, 2021

2020
Cutting planes for families implying Frankl's conjecture.
Math. Comput., 2020

Diameter Polytopes of Feasible Binary Programs.
CoRR, 2020

2017
Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks.
Appl. Soft Comput., 2017

2016
New Conjectures for Union-Closed Families.
Electron. J. Comb., 2016

Towards the Integration of Power-Indexed Formulations in Multi-Architecture Connected Facility Location Problems for the Optimal Design of Hybrid Fiber-Wireless Access Networks.
Proceedings of the 5th Student Conference on Operational Research, 2016

An (MI)LP-Based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design.
Proceedings of the Applications of Evolutionary Computation - 19th European Conference, 2016

2015
A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods.
Appl. Soft Comput., 2015

2014
A Hybrid Primal Heuristic for Robust Multiperiod Network Design.
Proceedings of the Applications of Evolutionary Computation - 17th European Conference, 2014


  Loading...