Ashwin Arulselvan

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