Matching supply and demand in a sharing economy: classification, computational complexity, and application
type: Item
instance of: scholarly article
title: Matching supply and demand in a sharing economy: classification, computational complexity, and application
zbMATH Open document ID: 1430.90064
author: Nils Boysen
author: Dirk Briskorn
author: Stefan Schwerdfeger
published in: European Journal of Operational Research
publication date: 2019-06-26T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 91B42
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 7073791
zbMATH Keywords: sharing economy
zbMATH Keywords: matching
zbMATH Keywords: classification
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.04.032
OpenAlex ID: W2940960946
cites work: Optimization for dynamic ride-sharing: a review
cites work: Scheduling jobs with fixed start and end times
cites work: Executing production schedules in the face of uncertainties: a review and some future directions
cites work: Scheduling equal-length jobs on identical parallel machines
cites work: A classification of assembly line balancing problems
cites work: Resource-constrained project scheduling: Notation, classification, models, and methods
cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines
cites work: A typology of cutting and packing problems
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: College Admissions and the Stability of Marriage
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Hamilton Paths in Grid Graphs
cites work: Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
cites work: Interval scheduling: A survey
cites work: On the computational complexity of (maximum) class scheduling
cites work: Q3409969
cites work: Robust discrete optimization and its applications
cites work: Interval scheduling on related machines
cites work: Q4124328
cites work: Kidney Exchange
cites work: Increasing the revenue of self-storage warehouses by optimizing order scheduling
Wikidata QID: Q127985280
DOI: 10.1016/J.EJOR.2019.04.032
description: scientific article; zbMATH DE number 7073791