Ashwin Arulselvan

According to our database1, Ashwin Arulselvan authored at least 22 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Scheduling Space-to-Ground Optical Communication Under Cloud Cover Uncertainty.
IEEE Trans. Aerosp. Electron. Syst., 2021

Robust formulations for economic lot-sizing problem with remanufacturing.
Eur. J. Oper. Res., 2021

Efficient methods for the distance-based critical node detection problem in complex networks.
Comput. Oper. Res., 2021

2019
The incremental connected facility location problem.
Comput. Oper. Res., 2019

2018
Matchings with Lower Quotas: Algorithms and Complexity.
Algorithmica, 2018

2017
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks.
INFORMS J. Comput., 2017

A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

Minimum controller substructure for generic arbitrary pole placement: Multicommodity flow and TSP based formulations.
Proceedings of the 15th European Control Conference, 2016

2015
An incremental algorithm for the uncapacitated facility location problem.
Networks, 2015

Graph orientation and flows over time.
Networks, 2015

On the geometric rank of matching polytope.
Math. Program., 2015

Many-to-one Matchings with Lower Quotas: Algorithms and Complexity.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014
A note on the set union knapsack problem.
Discret. Appl. Math., 2014

The Student/Project Allocation problem with group projects.
CoRR, 2014

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

2011
Discrete time dynamic traffic assignment models and solution algorithm for managed lanes.
J. Glob. Optim., 2011

MIP Modeling of Incremental Connected Facility Location.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Complexity analysis for maximum flow problems with arc reversals.
J. Comb. Optim., 2010

2009
Detecting critical nodes in sparse graphs.
Comput. Oper. Res., 2009

A Retrospective Review of Social Networks.
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.
Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining, 2009


  Loading...