A Polyhedral Approach to Online Bipartite Matching

DOI10.1007/978-3-319-33461-5_24zbMath1419.90099OpenAlexW2464159273MaRDI QIDQ3186510

Shabbir Ahmed, Alejandro Toriello, Alfredo Torrico

Publication date: 10 August 2016

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_24

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Generalized polynomial approximations in Markovian decision processes
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
• On Circulant Matrices
• Online Stochastic Matching: Online Actions Based on Offline Statistics
• A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
• Online Stochastic Weighted Matching: Improved Approximation Algorithms
• The Linear Programming Approach to Approximate Dynamic Programming
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
• Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
• A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
• Online Stochastic Matching: Beating 1-1/e
• Online Stochastic Matching: New Algorithms with Better Bounds
• A Price-Directed Approach to Stochastic Inventory/Routing

This page was built for publication: A Polyhedral Approach to Online Bipartite Matching