págs. 1-20
Dynamic Equilibria in Fluid Queueing Networks.
Roberto Cominetti, José Correa, Omar Larré
págs. 21-34
Understanding the Memory Effects in Pulsing Advertising.
Ashwin Aravindakshan, Prasad A. Naik
págs. 35-47
An Exact Decomposition Approach for the Real-Time Train Dispatching Problem.
Leonardo Lamorgese, Carlo Mannino
págs. 48-64
The Post-Disaster Debris Clearance Problem Under Incomplete Information.
Melih Çelik, Özlem Ergun, Pinar Keskinocak
págs. 65-85
Learning and Pricing with Models That Do Not Explicitly Incorporate Competition.
William L. Cooper, Tito Homem-de-Mello, Anton J. Kleywegt.
págs. 86-103
págs. 104-121
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object.
Steve Alpern, Thomas Lidbetter
págs. 122-133
Demand Estimation and Ordering Under Censoring: Stock-Out Timing Is (Almost) All You Need.
Aditya Jain, Nils Rudi, Tong Wang
págs. 134-150
Auction Design for the Efficient Allocation of Service Capacity Under Congestion.
Jorge Barrera, Alfredo García
págs. 151-165
Worst-Case Analysis of Process Flexibility Designs.
David Simchi-Levi, Yehua Wei
págs. 166-185
Lucy Gongtao Chen, Lawrence W. Robinson, Robin O. Roundy, Rachel Q. Zhang
págs. 186-197
págs. 198-211
Guillermo Gallego, Richard Ratliff, Sergey Shebalov
págs. 212-232
Ying Xu, Alan Scheller-Wolf, Katia Sycara
págs. 233-246
Strategic Arrivals into Queueing Networks: The Network Concert Queueing Game.
Harsha Honnappa, Rahul Jain
págs. 247-259
© 2008-2024 Fundación Dialnet · Todos los derechos reservados