Ashwin Arulselvan

According to our database, Ashwin Arulselvan authored at least 29 papers between 2009 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Solution techniques for Bi-level Knapsack Problems.

Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton

Comput. Oper. Res., November, 2023

The Cost of Quality of Service: SLA Aware VNF Placement and Routing Using Column Generation.

Andrew Murray, Ashwin Arulselvan, Marc Roper, Michael Cashmore, Swarup Kumar Mohalik, Ian Burdick, Sushanth David

Proceedings of the 13th International Workshop on Resilient Networks Design and Modeling, 2023

Automating and Decentralising Satellite-based Emergency Mapping.

Robert Cowlishaw, Red Boumghar, Ashwin Arulselvan, Annalisa Riccardi

Proceedings of the Fifth International Conference on Blockchain Computing and Applications, 2023

A Column Generation Approach to Correlated Simple Temporal Networks.

Andrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper, Jeremy Frank

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Economic lot-sizing problem with remanufacturing option: complexity and algorithms.

Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel

Optim. Lett., 2022

A heuristic approach for the distance-based critical node detection problem in complex networks.

Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao

J. Oper. Res. Soc., 2022

Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract).

Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

2021

Scheduling Space-to-Ground Optical Communication Under Cloud Cover Uncertainty.

Mateusz Polnik, Ashwin Arulselvan, Annalisa Riccardi

IEEE Trans. Aerosp. Electron. Syst., 2021

Robust formulations for economic lot-sizing problem with remanufacturing.

Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan

Eur. J. Oper. Res., 2021

Efficient methods for the distance-based critical node detection problem in complex networks.

Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao Jr.

Comput. Oper. Res., 2021

2019

The incremental connected facility location problem.

Ashwin Arulselvan, Andreas Bley, Ivana Ljubic

Comput. Oper. Res., 2019

2018

Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Algorithmica, 2018

2017

Exact Approaches for Designing Multifacility Buy-at-Bulk Networks.

Ashwin Arulselvan, Mohsen Rezapour, Wolfgang A. Welz

INFORMS J. Comput., 2017

A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option.

Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016

Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms.

Kerem Akartunali, Ashwin Arulselvan

Proceedings of the Machine Learning, Optimization, and Big Data, 2016

Minimum controller substructure for generic arbitrary pole placement: Multicommodity flow and TSP based formulations.

Atreya Kotoky, Ashutosh Mahajan, Ashwin Arulselvan, Madhu N. Belur, Rachel K. Kalaimani

Proceedings of the 15th European Control Conference, 2016

2015

An incremental algorithm for the uncapacitated facility location problem.

Ashwin Arulselvan, Olaf Maurer, Martin Skutella

Networks, 2015

Graph orientation and flows over time.

Ashwin Arulselvan, Martin Groß, Martin Skutella

Networks, 2015

On the geometric rank of matching polytope.

Ashwin Arulselvan

Math. Program., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.

Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

A note on the set union knapsack problem.

Ashwin Arulselvan

Discret. Appl. Math., 2014

The Student/Project Allocation problem with group projects.

Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke

CoRR, 2014

2013

A proof for Padberg's conjecture on rank of matching polytope.

Ashwin Arulselvan, Daniel Karch

CoRR, 2013

2011

Discrete time dynamic traffic assignment models and solution algorithm for managed lanes.

Qipeng P. Zheng, Ashwin Arulselvan

J. Glob. Optim., 2011

MIP Modeling of Incremental Connected Facility Location.

Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Complexity analysis for maximum flow problems with arc reversals.

Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos

J. Comb. Optim., 2010

2009

Detecting critical nodes in sparse graphs.

Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos

Comput. Oper. Res., 2009

A Retrospective Review of Social Networks.

Petros Xanthopoulos, Ashwin Arulselvan, Vladimir Boginski, Panos M. Pardalos

Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009

Predicting the Nexus between Post-Secondary Education Affordability and Student Success: An Application of Network-Based Approaches.

Ashwin Arulselvan, Pilar Mendoza, Vladimir Boginski, Panos M. Pardalos

Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009