The following pages link to Ashwin Arulselvan (Q494321):
Displaying 10 items.
- On the geometric rank of matching polytope (Q494322) (← links)
- Discrete time dynamic traffic assignment models and solution algorithm for managed lanes (Q652653) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- Matchings with lower quotas: algorithms and complexity (Q1702126) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- Economic lot-sizing problem with remanufacturing option: complexity and algorithms (Q2115304) (← links)
- The incremental connected facility location problem (Q2329719) (← links)
- A note on the set union knapsack problem (Q2449074) (← links)
- Efficient methods for the distance-based critical node detection problem in complex networks (Q2668688) (← links)