Ashwin Arulselvan

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 17

Top Topics

Simple Temporal

Facility Location

Multicommodity Flow

Chance Constrained

Top Venues

Comput. Oper. Res.

Publications

Robert Cowlishaw, Ashwin Arulselvan, Annalisa Riccardi
Multi-Objective Optimisation strategy for On-Orbit Fault-Tolerant Decision Making. CEC (2024)
Andrew Murray, Ashwin Arulselvan, Marc Roper, Michael Cashmore, Swarup Kumar Mohalik, Ian Burdick, Sushanth David
The Cost of Quality of Service: SLA Aware VNF Placement and Routing Using Column Generation. RNDM (2023)
Andrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper, Jeremy Frank
A Column Generation Approach to Correlated Simple Temporal Networks. ICAPS (2023)
Robert Cowlishaw, Red Boumghar, Ashwin Arulselvan, Annalisa Riccardi
Automating and Decentralising Satellite-based Emergency Mapping. BCCA (2023)
Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton
Solution techniques for Bi-level Knapsack Problems. Comput. Oper. Res. 159 (2023)
Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank
Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract). SOCS (2022)
Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao
A heuristic approach for the distance-based critical node detection problem in complex networks. J. Oper. Res. Soc. 73 (6) (2022)
Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel
Economic lot-sizing problem with remanufacturing option: complexity and algorithms. Optim. Lett. 16 (2) (2022)
Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan
Robust formulations for economic lot-sizing problem with remanufacturing. Eur. J. Oper. Res. 288 (2) (2021)
Glory Uche Alozie, Ashwin Arulselvan, Kerem Akartunali, Eduardo L. Pasiliao Jr.
Efficient methods for the distance-based critical node detection problem in complex networks. Comput. Oper. Res. 131 (2021)
Mateusz Polnik, Ashwin Arulselvan, Annalisa Riccardi
Scheduling Space-to-Ground Optical Communication Under Cloud Cover Uncertainty. IEEE Trans. Aerosp. Electron. Syst. 57 (5) (2021)
Ashwin Arulselvan, Andreas Bley, Ivana Ljubic
The incremental connected facility location problem. Comput. Oper. Res. 112 (2019)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80 (1) (2018)
Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan
A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. ICCSA (2) (2017)
Ashwin Arulselvan, Mohsen Rezapour, Wolfgang A. Welz
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks. INFORMS J. Comput. 29 (4) (2017)
Kerem Akartunali, Ashwin Arulselvan
Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms. MOD (2016)
Atreya Kotoky, Ashutosh Mahajan, Ashwin Arulselvan, Madhu N. Belur, Rachel K. Kalaimani
Minimum controller substructure for generic arbitrary pole placement: Multicommodity flow and TSP based formulations. ECC (2016)
Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC (2015)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph orientation and flows over time. Networks 66 (3) (2015)
Ashwin Arulselvan
On the geometric rank of matching polytope. Math. Program. 152 (1-2) (2015)
Ashwin Arulselvan, Olaf Maurer, Martin Skutella
An incremental algorithm for the uncapacitated facility location problem. Networks 65 (4) (2015)
Ashwin Arulselvan
A note on the set union knapsack problem. Discret. Appl. Math. 169 (2014)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph Orientation and Flows Over Time. CoRR (2014)
Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke
The Student/Project Allocation problem with group projects. CoRR (2014)
Ashwin Arulselvan, Martin Groß, Martin Skutella
Graph Orientation and Flows over Time. ISAAC (2014)
Ashwin Arulselvan, Daniel Karch
A proof for Padberg's conjecture on rank of matching polytope. CoRR (2013)
Qipeng P. Zheng, Ashwin Arulselvan
Discrete time dynamic traffic assignment models and solution algorithm for managed lanes. J. Glob. Optim. 51 (1) (2011)
Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer
MIP Modeling of Incremental Connected Facility Location. INOC (2011)
Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos
Complexity analysis for maximum flow problems with arc reversals. J. Comb. Optim. 19 (2) (2010)
Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos
Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36 (7) (2009)
Ashwin Arulselvan, Pilar Mendoza, Vladimir Boginski, Panos M. Pardalos
Predicting the Nexus between Post-Secondary Education Affordability and Student Success: An Application of Network-Based Approaches. ASONAM (2009)
Petros Xanthopoulos, Ashwin Arulselvan, Vladimir Boginski, Panos M. Pardalos
A Retrospective Review of Social Networks. ASONAM (2009)