A Polyhedral Approach to Online Bipartite Matching

DOI10.1007/978-3-319-33461-5_24MaRDI QIDQ3186510zbMATH OpenOpenAlexFDO

Authors S. 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)

Recommendations

• A polyhedral approach to online bipartite matching
• Online matching in regular bipartite graphs
• Online total bipartite matching problem
• Tighter bounds for online bipartite matching
• An Experimental Study of Algorithms for Online Bipartite Matching
• A robust and optimal online algorithm for minimum metric bipartite matching
• Online bipartite matching with decomposable weights

Cites work

• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• A dynamic traveling salesman problem with stochastic arc costs
• A Price-Directed Approach to Stochastic Inventory/Routing
• A unifying approximate dynamic programming model for the economic lot scheduling problem
• Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
• Generalized polynomial approximations in Markovian decision processes
• On circulant matrices
• Online Stochastic Matching: Beating 1-1/e
• 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

(4)

• A polynomial algorithm for b-matchings: An alternative approach
• A polyhedral approach to online bipartite matching
• Online total bipartite matching problem
• scientific article; zbMATH DE number 7236471 (Why is no real title available?)

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 Q3186510)