Online generalized assignment problem with historical information
type: Item
instance of: scholarly article
title: Online generalized assignment problem with historical information
author: Haodong Liu
author: Huili Zhang
author: Kelin Luo
author: Yao Xu
author: Weitian Tong
author: Yinfeng Xu
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634087
zbMATH Keywords: online generalized assignment problem
zbMATH Keywords: online packing problem
zbMATH Keywords: historical information
zbMATH Keywords: random order model
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106047
OpenAlex ID: W4306411422
cites work: A Dynamic Near-Optimal Algorithm for Online Linear Programming
cites work: The Online Stochastic Generalized Assignment Problem
cites work: The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
cites work: A Knapsack Secretary Problem with Applications
cites work: Online Primal-Dual Algorithms for Covering and Packing
cites work: A survey of algorithms for the generalized assignment problem
cites work: Task design in complex crowdsourcing experiments: item assignment optimization
cites work: Online Stochastic Packing Applied to Display Ad Allocation
cites work: Online unweighted knapsack problem with removal cost
cites work: Randomized algorithms for online knapsack problems
cites work: Online Knapsack Problem Under Concave Functions
cites work: Online removable knapsack with limited cuts
cites work: Q4737165
cites work: Competitive Analysis with a Sample and the Secretary Problem
cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
cites work: Primal Beats Dual on Online Packing LPs in the Random-Order Model
cites work: The dynamic and stochastic knapsack problem
cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs
cites work: Online Mechanism Design (Randomized Rounding on the Fly)
cites work: A stochastic algorithm for online bipartite resource allocation problems
cites work: Average-Case Analysis of Off-Line and On-Line Knapsack Problems
cites work: Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
cites work: Stochastic on-line knapsack problems
cites work: A scalable dynamic parking allocation framework
cites work: Geometry of Online Packing Linear Programs
cites work: A Survey of the Generalized Assignment Problem and Its Applications
cites work: The Dynamic and Stochastic Knapsack Problem with Deadlines
cites work: Technical Note—Online Hypergraph Matching with Delays
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: A data-driven matching algorithm for ride pooling problem
cites work: Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
cites work: Online Resource Allocation with Personalized Learning
cites work: Online crowdsourced truck delivery using historical information
DOI: 10.1016/J.COR.2022.106047
description: scientific article; zbMATH DE number 7634087