default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshwin Arulselvan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Robert Cowlishaw
, Annalisa Riccardi, Ashwin Arulselvan:
Optimizing Participant Selection for Fault-Tolerant Decision Making in Orbit Using Mixed Integer Linear Programming. IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 17: 16961-16969 (2024)- [c13]Robert Cowlishaw, Ashwin Arulselvan, Annalisa Riccardi:
Multi-Objective Optimisation strategy for On-Orbit Fault-Tolerant Decision Making. CEC 2024: 1-7 - 2023
- [j16]Shraddha Ghatkar, Ashwin Arulselvan, Alec Morton:
Solution techniques for Bi-level Knapsack Problems. Comput. Oper. Res. 159: 106343 (2023) - [c12]Andrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper, Jeremy Frank:
A Column Generation Approach to Correlated Simple Temporal Networks. ICAPS 2023: 295-303 - [c11]Robert Cowlishaw, Red Boumghar, Ashwin Arulselvan, Annalisa Riccardi:
Automating and Decentralising Satellite-based Emergency Mapping. BCCA 2023: 76-81 - [c10]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: 1-8 - 2022
- [j15]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): 1347-1361 (2022) - [j14]Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel:
Economic lot-sizing problem with remanufacturing option: complexity and algorithms. Optim. Lett. 16(2): 421-432 (2022) - [c9]Andrew Murray, Michael Cashmore, Ashwin Arulselvan, Jeremy Frank:
Joint Chance Constrained Probabilistic Simple Temporal Networks via Column Generation (Extended Abstract). SOCS 2022: 305-307 - 2021
- [j13]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: 105254 (2021) - [j12]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
Robust formulations for economic lot-sizing problem with remanufacturing. Eur. J. Oper. Res. 288(2): 496-510 (2021) - [j11]Mateusz Polnik, Ashwin Arulselvan, Annalisa Riccardi:
Scheduling Space-to-Ground Optical Communication Under Cloud Cover Uncertainty. IEEE Trans. Aerosp. Electron. Syst. 57(5): 2838-2849 (2021)
2010 – 2019
- 2019
- [j10]Ashwin Arulselvan, Andreas Bley, Ivana Ljubic:
The incremental connected facility location problem. Comput. Oper. Res. 112 (2019) - 2018
- [j9]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Matchings with Lower Quotas: Algorithms and Complexity. Algorithmica 80(1): 185-208 (2018) - 2017
- [j8]Ashwin Arulselvan, Mohsen Rezapour, Wolfgang A. Welz:
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks. INFORMS J. Comput. 29(4): 597-611 (2017) - [c8]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. ICCSA (2) 2017: 684-695 - 2016
- [c7]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: 849-854 - [c6]Kerem Akartunali, Ashwin Arulselvan:
Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms. MOD 2016: 132-143 - 2015
- [j7]Ashwin Arulselvan:
On the geometric rank of matching polytope. Math. Program. 152(1-2): 189-200 (2015) - [j6]Ashwin Arulselvan, Olaf Maurer, Martin Skutella:
An incremental algorithm for the uncapacitated facility location problem. Networks 65(4): 306-311 (2015) - [j5]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph orientation and flows over time. Networks 66(3): 196-209 (2015) - [c5]Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke:
Many-to-one Matchings with Lower Quotas: Algorithms and Complexity. ISAAC 2015: 176-187 - 2014
- [j4]Ashwin Arulselvan:
A note on the set union knapsack problem. Discret. Appl. Math. 169: 214-218 (2014) - [c4]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows over Time. ISAAC 2014: 741-752 - [i3]Ashwin Arulselvan, Martin Groß, Martin Skutella:
Graph Orientation and Flows Over Time. CoRR abs/1409.3081 (2014) - [i2]Ashwin Arulselvan, Ágnes Cseh, Jannik Matuschke:
The Student/Project Allocation problem with group projects. CoRR abs/1412.0325 (2014) - 2013
- [i1]Ashwin Arulselvan, Daniel Karch:
A proof for Padberg's conjecture on rank of matching polytope. CoRR abs/1309.1347 (2013) - 2011
- [j3]Qipeng P. Zheng, Ashwin Arulselvan:
Discrete time dynamic traffic assignment models and solution algorithm for managed lanes. J. Glob. Optim. 51(1): 47-68 (2011) - [c3]Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer:
MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502 - 2010
- [j2]Steffen Rebennack, Ashwin Arulselvan, Lily Elefteriadou, Panos M. Pardalos:
Complexity analysis for maximum flow problems with arc reversals. J. Comb. Optim. 19(2): 200-216 (2010)
2000 – 2009
- 2009
- [j1]Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos:
Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36(7): 2193-2200 (2009) - [c2]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: 149-154 - [c1]Petros Xanthopoulos, Ashwin Arulselvan, Vladimir Boginski, Panos M. Pardalos:
A Retrospective Review of Social Networks. ASONAM 2009: 300-305
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
