págs. 527-540
Dynamic Hedging Under Jump Diffusion with Transaction Costs.
J.S. Kennedy, P.A. Forsyth, K.R. Vetzal
págs. 541-559
págs. 560-577
Moshe Kress, Roberto Szechtman
págs. 578-585
Incremental Network Optimization: Theory and Algorithms.
Onur Seref, Ravindra K. Ahuja, James B. Orlin
págs. 586-594
Bounds for Maximin Latin Hypercube Designs.
Edwin R. van Dam, Gijs Rennen, Bart Husslage
págs. 595-608
Large-Scale, Less-than-Truckload Service Network Designs.
Ahmad I. Jarrah, Ellis Johnson, Lucas C. Neubert
págs. 609-625
Optimal Policies for Inventory Sustems with Separate Delivery-Request and Order-Quantity Decisions.
Qing Li, Xiaoli Wu, Ki Ling Cheung
págs. 626-636
Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management.
Huseyin Topaloglu
págs. 637-649
P. Bonami, M.A. Lejeune
págs. 650-670
Dynamic Capacity Management with Substitution.
Robert A. Shumsky, Fuqiang Zhang
págs. 671-684
Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements.
Opher Baron, Joseph Milner
págs. 685-700
Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables.
Han-Lin Li, Hao-Chun Lu
págs. 701-713
On a Data-Driven Method for Staffing Large Call Centers.
Achal Bassamboo, Assaf Zeevi
págs. 714-726
Stephen Baumert, Archis Ghate, Seksan Kiatsupaibul, Yanfang Shen, Yanfang Smith, Robert L. Smith, Zelda B. Zabinsky
págs. 727-739
págs. 740-752
Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs.
Baris Ata, Tava Lennon Olsen
págs. 753-768
A Column Generation algorithm for Choice-Based Network Revenue Management.
Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo Vulcano
págs. 769-784
A Multiperiod Model of Inventory Competition.
Mahesh Nagarajan, S. Rajagopalan
págs. 785-790
A note on "The Censored Newsvendor and the Optimal Acquisition of Information".
Alain Bensoussan, Metin Cakanyildirim, Suresh P. Sethi
págs. 791-794
© 2008-2024 Fundación Dialnet · Todos los derechos reservados