Online spatio-temporal matching in stochastic and dynamic domains
type: Item
instance of: scholarly article
title: Online spatio-temporal matching in stochastic and dynamic domains
zbMATH Open document ID: 1448.90020
author: Meghna Lowalekar
author: Pradeep Varakantham
author: Patrick Jaillet
published in: Artificial Intelligence
publication date: 2018-06-27T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 6895039
zbMATH Keywords: online matching
zbMATH Keywords: online linear programming
zbMATH Keywords: stochastic optimization
zbMATH Keywords: MDPs
MaRDI profile type: Publication
full work available at URL: j.artint.2018.04.005
OpenAlex ID: W2799785707
cites work: Q5365114
cites work: A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
cites work: Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems
cites work: Approximate Dynamic Programming
cites work: Commitment under uncertainty: Two-stage stochastic matching problems
cites work: Q4223058
cites work: Online Stochastic Matching: New Algorithms with Better Bounds
cites work: Online matching and ad allocation
cites work: Online stochastic matching: online actions based on offline statistics
cites work: Online algorithms for market clearing
cites work: Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
cites work: On-line single-server dial-a-ride problems
cites work: Q4411400
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: Hybrid column generation and large neighborhood search for the dial-a-ride problem
cites work: Dynamic programming based metaheuristics for the dial-a-ride problem
cites work: An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, II: Multiperiod Travel Times
cites work: Algorithms for Reinforcement Learning
cites work: Online Markov Decision Processes
cites work: Lectures on Stochastic Programming
cites work: On complexity of multistage stochastic programs
cites work: An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
cites work: A stochastic algorithm for online bipartite resource allocation problems
cites work: Partitioning procedures for solving mixed-variables programming problems
DOI: 10.1016/J.ARTINT.2018.04.005
description: scientific article; zbMATH DE number 6895039