Operations research

• 

  Año 2020, Número 3

  • Dynamic Nonlinear Pricing of Inventories over Finite Sales Horizons

    Guillermo Gallego, Michael Z. F. Li, Yan Liu

    págs. 655-670

    

  • Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands

    Luca Bertazzi, Nicola Secomandi

    págs. 671-675

    

  • Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements

    Yanzhe Lei, Stefanus Jasin

    págs. 676-685

    

  • Modeling and Design of Container Terminal Operations

    Debjit Roy, René De Koster, René Bakker

    págs. 686-715

    

  • The Distributionally Robust Chance-Constrained Vehicle Routing Problem

    Shubhechyya Ghosal, Wolfram Wiesemann

    págs. 716-732

    

  • Technical Note—Options Portfolio Selection

    Paolo Guasoni, Eberhard Mayerhofer

    págs. 733-740

    

  • Assortment Optimization Under the Paired Combinatorial Logit Model

    Heng Zhang, Paat Rusmevichientong, Huseyin Topaloglu

    págs. 741-761

    

  • An Efficient Frontier Approach to Scoring and Ranking Hospital Performance

    Daniel Adelman

    págs. 762-792

    

  • Sustainability Planning for Healthcare Information Exchanges with Supplier Rebate Program

    Tharanga Rajapakshe, Subodha Kumar, Arun Sen, Chelliah Sriskandarajah

    págs. 793-817

    

  • Optimal Nonlinear Pricing in Social Networks Under Asymmetric Network Information

    Yang Zhang, Ying-Ju Chen

    págs. 818-833

    

  • An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals

    Yuhang Ma, Paat Rusmevichientong, Mika Sumida, Huseyin Topaloglu

    págs. 834-855

    

  • Adaptive Submodular Ranking and Routing

    Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan

    págs. 856-877

    

  • The Benders Dual Decomposition Method

    Ragheb Rahmaniani, Shabbir Ahmed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei

    págs. 878-895

    

  • Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs

    David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, Mohammadtaghi Hajiaghayi, Howard Karloff, Mauricio G.C. Resende, Subhabrata Sen

    págs. 896-926

    

  • Deadlines, Offer Timing, and the Search for Alternatives

    Saša Zorc, Ilia Tsetlin

    págs. 927-948

    

  • Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms

    Dimitris Bertsimas, Bradley Sturt

    págs. 949-964