A polyhedral approach to online bipartite matching
From MaRDI portal
(Redirected from Publication:1801015)
Recommendations
- A Polyhedral Approach to Online Bipartite Matching
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online bipartite matching with unknown distributions
- New algorithms, better bounds, and a novel model for online stochastic matching
- Online stochastic matching: new algorithms and bounds
Cites work
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- A Price-Directed Approach to Stochastic Inventory/Routing
- A dynamic traveling salesman problem with stochastic arc costs
- A unifying approximate dynamic programming model for the economic lot scheduling problem
- AdWords and generalized online matching
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Generalized polynomial approximations in Markovian decision processes
- Improved Bounds for Online Stochastic Matching
- On circulant matrices
- Online Stochastic Matching: Beating 1-1/e
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online matching and ad allocation
- Online stochastic matching: new algorithms with better bounds
- Online stochastic weighted matching: improved approximation algorithms
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
- The Linear Programming Approach to Approximate Dynamic Programming
Cited in
(6)
This page was built for publication: A polyhedral approach to online bipartite matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801015)
