Jing-Sheng Song, Li Xiao, Hanqin Zhang
págs. 2867-2885
Nested Set-Covering/Packing Problem: Degeneracy Alleviation and Dual Stabilization
Siqi Guo, Fan Xiao, Zhe Liang
págs. 2886-2913
E-Commerce Order Fulfillment Problem with Limited Time Window
Siqi Guo, Fan Xiao, Zhe Jiang
págs. 2886-2913
Optimal Trading with Speed-Dependent Transaction Cost Rates: A Flexible Framework
Hong Liu, Shuaijie Qian, Jing Xu
págs. 2933-2952
Coordinated Inventory Stocking and Assortment Customization
Yicheng Bai, Omar El Housni, Paat Rusmevichientong, Huseyin Topaloglu
págs. 2953-2971
Deterministic Budget-Feasible Clock Auctions
Eric Balkanski, Pranav Garimidi, Vasilis Gkatzelis, Daniel Schoepflin, Xizhi Tan
págs. 2972-2985
ORLM: A Customizable Framework in Training Large Models for Automated Optimization Modeling
Chenyu Huang, Zhengyang Tang, Shixi Hu, Ruoqing Jiang, Xin Zheng, Dongdong Ge, Benyou Wang, Zizhuo Wang
págs. 2986-3009
Yifan Lin, Yuhao Wang, Enlu Zhou
págs. 3010-3026
Dynamic Pricing with Fairness Constraints
Maxime C. Cohen, Sentao Miao, Yining Wang
págs. 3027-3043
A Stability Principle for Learning Under Nonstationarity
Chengpiao Huang, Kaizheng Wang
págs. 3044-3064
Estimation of High-Dimensional Contextual Pricing Models with Nonparametric Price Confounders
Yining Wang, Quanquan Liu
págs. 3065-3084
Learning to Schedule in Multiclass Many-Server Queues with Abandonment
Yueyang Zhong, John R. Birge, Amy R. Ward
págs. 3085-3103
The Price of Fairness of Scheduling a Scarce Resource
Shai Vardi, William Haskell
págs. 3104-3117
Robust Optimization with Moment-Dispersion Ambiguity
Li Chen, Chenyi Fu, Fan Si, Melvyn Sim, Peng Xiong
págs. 3118-3138
Jing Dong, Rouba Ibrahim
págs. 3139-3155
First-Order Prudence and Its Implications for Precautionary Savings and the Risk-Free Rate
Sebastian Ebert, Paul Karehnke
págs. 3156-3172
The Fragility of Optimized Bandit Algorithms
Lin Fan, Peter W. Glynn
págs. 3173-3198
Selection of the Most Probable Best
Taeho Kim, Kyoung-Kuk Kim, Eunhye Song
págs. 3199-3218
Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
Wenjia Ba, Tianyi Lin, Jiawei Zhang, Zhengyuan Zhou
págs. 3219-3244
Technical Note—Data-Driven Sample Average Approximation with Covariate Information
Rohit Kannan, Güzin Bayraksan, James Luedtke
págs. 3245-3259
Joint Bottom-up Method for Probabilistic Forecasting of Hierarchical Time Series
Nicolò Bertani, Shane T. Jensen, Ville A. Satopää
págs. 3260-3277
Envy-Free Dynamic Pricing Schemes
Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev
págs. 3278-3293
Coverage-Validity-Aware Algorithmic Recourse
Ngoc Bui, Duy Nguyen, Man-Chung Yue, Viêt-Anh Nguyên
págs. 3294-3310
Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems
Sandy Spiers, Hoa T. Bui, Ryan Loxton
págs. 3311-3332
Technical Note—First-Stage Sampling in Ranking and Selection: Beyond Variance Estimation
Weiwei Fan, Xuewen Li, Jun Luo, Shing Chih Tsai
págs. 3333-3344
Technical Note—Multistage Robust Mixed-Integer Programming
Krzysztof Postek, Ward Romeijnders, Wolfram Wiesemann
págs. 3345-3358
Optimizing the Trade-off Between Batching and Waiting: Subadditive Dispatching
Ignacio Erazo, Alejandro Toriello
págs. 3359-3388
págs. 3389-3404
Degeneracy Is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Jiashuo Jiang, Will Ma, Jiawei Zhang
págs. 3405-3420
Distributionally Robust Optimal Allocation with Costly Verification
Halil İbrahim Bayrak, Çağıl Koçyiğit, Daniel Kuhn, Mustafa Çelebi Pınar
págs. 3421-3439
© 2008-2026 Fundación Dialnet · Todos los derechos reservados