Dual bounds of a service level assignment problem with applications to efficient pricing
From MaRDI portal
Publication:1754037
DOI10.1016/j.ejor.2017.03.078zbMath1403.90248OpenAlexW2604138123MaRDI QIDQ1754037
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.078
Related Items
Calculation of the performance region of an easy-to-optimize alternative for generalized processor sharing ⋮ Ride solo or pool: designing price-service menus for a ride-sharing platform
Cites Work
- Unnamed Item
- The auction algorithm for the transportation problem
- An adjustment scheme for nonlinear pricing problem with two buyers
- Monopoly and product quality
- The auction algorithm: A distributed relaxation method for the assignment problem
- The package assignment model.
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Learning in nonlinear pricing with unknown utility functions
- The assignment game. I: The core
- Stability and Chaos in Input Pricing for a Service Facility with Adaptive Customer Response to Congestion
- The impact of the composition of the customer base in general queueing models
- Revenue Optimization for a Make-to-Order Queue in an Uncertain Market Environment
- Price and Service Discrimination in Queuing Systems: Incentive Compatibility of Gcμ Scheduling
- Optimal Pricing That Coordinates Queues with Customer-Chosen Service Requirements
- Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure
- Competition in Service Industries with Segmented Markets
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Assignment Problems and the Location of Economic Activities
- Competition in Service Industries
- A Market-Based Approach to Optimal Resource Allocation in Integrated-Services Connection-Oriented Networks
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- An Auction Algorithm for Shortest Paths
- Pricing and Capacity Decisions for a Service Facility: Stability and Multiple Local Optima
- Priority Pricing
- Pricing, Production, Scheduling, and Delivery-Time Competition
- Evolutionary Implementation and Congestion Pricing
- Optimum Bribing for Queue Position
- The Regulation of Queue Size by Levying Tolls
