The following pages link to Anirudh Subramanyam (Q320684):
Displaying 12 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q2101650) (← links)
- Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
- \(K\)-adaptability in two-stage mixed-integer robust optimization (Q2195680) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
- Optimization under Rare Chance Constraints (Q5081097) (← links)
- Joint Routing of Conventional and Range-Extended Electric Vehicles in a Large Metropolitan Network (Q6386585) (← links)
- Electric Vehicle Supply Equipment Location and Capacity Allocation for Fixed-Route Networks (Q6509892) (← links)
- Correction to: A Lagrangian dual method for two-stage robust optimization with binary uncertainties (Q6752359) (← links)
- Reduced Sample Complexity in Scenario-Based Control System Design via Constraint Scaling (Q6753008) (← links)
- Neural Embedded Mixed-Integer Optimization for Location-Routing Problems (Q6757038) (← links)
