default search action
Shivaram Subramanian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Zhengliang Xue, Shivaram Subramanian, Markus Ettl:
Loss-Leader Pricing Strategies for Personalized Bundles under Customer Choice. HICSS 2024: 1518-1527 - [i4]Wei Sun, Scott McFaddin, Linh Ha Tran, Shivaram Subramanian, Kristjan H. Greenewald, Yeshi Tenzin, Zack Xue, Youssef Drissi, Markus Ettl:
PresAIse, A Prescriptive AI Solution for Enterprises. CoRR abs/2402.02006 (2024) - 2023
- [c4]Shivaram Subramanian, Wei Sun:
Scalable Optimal Multiway-Split Decision Trees with Constraints. AAAI 2023: 9891-9899 - [c3]Markus Ettl, Shivaram Subramanian, Youssef Drissi, Wei Sun:
Context-based Pricing for Revenue Optimization with Applications to the Airline Industry. HICSS 2023: 1366-1375 - [i3]Shivaram Subramanian, Wei Sun:
Scalable Optimal Multiway-Split Decision Trees with Constraints. CoRR abs/2302.06812 (2023) - [i2]Pavithra Harsha, Shivaram Subramanian, Ali Koc, Mahesh Ramakrishna, Brian Quanz
, Dhruv Shah, Chandra Narayanaswami:
An Optimistic-Robust Approach for Dynamic Positioning of Omnichannel Inventories. CoRR abs/2310.12183 (2023) - 2022
- [c2]Shivaram Subramanian, Wei Sun, Youssef Drissi, Markus Ettl:
Constrained Prescriptive Trees via Column Generation. AAAI 2022: 4602-4610 - [i1]Shivaram Subramanian, Wei Sun, Youssef Drissi, Markus Ettl:
Constrained Prescriptive Trees via Column Generation. CoRR abs/2207.10163 (2022) - 2021
- [j9]Shivaram Subramanian
Demand Modeling in the Presence of Unobserved Lost Sales. Manag. Sci. 67(6): 3803-3833 (2021)
2010 – 2019
- 2019
- [j8]Pavithra Harsha
A Practical Price Optimization Approach for Omnichannel Retailing. INFORMS J. Optim. 1(3): 241-264 (2019) - [j7]Pavithra Harsha
Dynamic Pricing of Omnichannel Inventories. Manuf. Serv. Oper. Manag. 21(1): 47-65 (2019) - 2013
- [c1]Shivaram Subramanian
Dynamic price optimization models for managing time-of-day electricity usage. SmartGridComm 2013: 163-168 - 2010
- [j6]Shivaram Subramanian
A fractional programming approach for retail category price optimization. J. Glob. Optim. 48(2): 263-277 (2010)
2000 – 2009
- 2008
- [j5]Shivaram Subramanian
An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems. INFORMS J. Comput. 20(4): 565-578 (2008) - 2002
- [j4]Hanif D. Sherali, Intesar Al-Loughani, Shivaram Subramanian
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems. Oper. Res. 50(3): 433-448 (2002) - 2001
- [j3]Hanif D. Sherali, Shivaram Subramanian
Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality. J. Glob. Optim. 19(1): 1-26 (2001) - 2000
- [b1]Shivaram Subramanian:
Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks. Virginia Tech, Blacksburg, VA, USA, 2000
1990 – 1999
- 1998
- [j2]Hanif D. Sherali, Kaan Özbay, Shivaram Subramanian:
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms. Networks 31(4): 259-272 (1998) - 1997
- [j1]Hanif D. Sherali, Laora D. Brizendine, Theodore S. Glickman, Shivaram Subramanian
Low Probability - High Consequence Considerations in Routing Hazardous Material Shipments. Transp. Sci. 31(3): 237-251 (1997)
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-08-05 20:22 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: