Shaojie Tang
21 catalog papers. Identity-linked publications and additional name matches are distinguished below.
ORCID: 0000-0001-9261-5210
Department of Management Science and Systems, University at Buffalo, Buffalo, NY, USA
Publications
- Deep Reinforcement Learning for Online Assortment Customization: A Data-Driven Approach — Production and Operations Management 2026
- Should Ad Exchanges Subsidize Advertisers to Acquire Targeting Data? — Information Systems Research 2025
- A New Approximation Algorithm for Minimum-Weight(1,𝑚)(1,m)–Connected Dominating Set — INFORMS Journal on Computing 2025
- Group Equality in Adaptive Submodular Maximization — INFORMS Journal on Computing 2024
- Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio — INFORMS Journal on Computing 2024
- Federated Optimization Under Intermittent Client Availability — INFORMS Journal on Computing 2024
- When Is More Merrier? A Cloud-Based Architecture to Procure Impressions from Multiple Ad Exchanges — Information Systems Research 2024
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications — INFORMS Journal on Computing 2022
- Toward Robust Monitoring of Malicious Outbreaks — INFORMS Journal on Computing 2022
- Robust Adaptive Submodular Maximization — INFORMS Journal on Computing 2022
- Blockchain-Enabled Data Sharing in Supply Chains: Model, Operationalization, and Tutorial — Production and Operations Management 2021
- Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz — Production and Operations Management 2021
- A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks — INFORMS Journal on Computing 2021
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem — INFORMS Journal on Computing 2021
- Exact Algorithms for the Minimum Load Spanning Tree Problem — INFORMS Journal on Computing 2021
- Differentially Private and Budget-Limited Bandit Learning over Matroids — INFORMS Journal on Computing 2020
- A Switch in Time Saves the Dime: A Model to Reduce Rental Cost in Cloud Computing — Information Systems Research 2020
- Differentially Private Distributed Learning — INFORMS Journal on Computing 2020
- Computing Minimumk-Connectedm-Fold Dominating Set in General Graphs — INFORMS Journal on Computing 2018
- Breaking theO(lnn) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set — INFORMS Journal on Computing 2018
- Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks — INFORMS Journal on Computing 2016