A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods F D’andreagiovanni, J Krolikowski, J Pulaj Applied Soft Computing 26, 497-507, 2015 | 74 | 2015 |
Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks F D’andreagiovanni, F Mett, A Nardin, J Pulaj Applied Soft Computing 61, 1074-1087, 2017 | 30 | 2017 |
Cutting planes for families implying Frankl’s conjecture J Pulaj Mathematics of Computation 89 (322), 829-857, 2020 | 14* | 2020 |
A safe computational framework for integer programming applied to chvátal’s conjecture L Eifler, A Gleixner, J Pulaj ACM Transactions on Mathematical Software (TOMS) 48 (2), 1-12, 2022 | 7 | 2022 |
On the linear ordering problem and the rankability of data TR Cameron, S Charmot, J Pulaj arXiv preprint arXiv:2104.05816, 2021 | 7 | 2021 |
New Conjectures for Union-Closed Families J Pulaj, A Raymond, D Theis Electronic Journal of Combinatorics 23 (3), 2016 | 7 | 2016 |
A hybrid primal heuristic for Robust Multiperiod Network Design F D’andreagiovanni, J Krolikowski, J Pulaj European Conference on the Applications of Evolutionary Computation, 15-26, 2014 | 6 | 2014 |
An (MI) LP-based primal heuristic for 3-architecture connected facility location in urban access network design F D’andreagiovanni, F Mett, J Pulaj European Conference on the Applications of Evolutionary Computation, 283-298, 2016 | 5 | 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 F D’andreagiovanni, F Mett, J Pulaj 5th Student Conference on Operational Research (SCOR 2016), 2016 | 5 | 2016 |
Characterizing 3-sets in union-closed families J Pulaj Experimental Mathematics 32 (2), 350-361, 2023 | 3 | 2023 |
Using skip graphs for increased NUMA locality S Thomas, R Hayne, J Pulaj, H Mendes Journal of Parallel and Distributed Computing 167, 31-49, 2022 | 2 | 2022 |
Diameter polytopes of feasible binary programs TR Cameron, S Charmot, J Pulaj arXiv preprint arXiv:2008.06844, 2020 | 1 | 2020 |
Automating weight function generation in graph pebbling D Flocco, J Pulaj, C Yerger Discrete Applied Mathematics 347, 155-174, 2024 | | 2024 |
Expiring Assets in Automated Market Makers K Wood, M Herlihy, H Mendes, J Pulaj arXiv preprint arXiv:2401.04289, 2024 | | 2024 |
Verifying MILP Certificates with SMT Solvers R Zhou, H Wu, H Mendes, J Pulaj arXiv preprint arXiv:2312.10420, 2023 | | 2023 |
Local Configurations in Union-Closed Families K Wood, J Pulaj 2023 Joint Mathematics Meetings (JMM 2023), 0 | | |