Online generalized assignment problem with historical information

DOI10.1016/j.cor.2022.106047OpenAlexW4306411422MaRDI QIDQ2108140

Hui-Li Zhang, Haodong Liu, Yao Xu, Weitian Tong, Kelin Luo, Yin-Feng Xu

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106047

zbMATH Keywords

competitive analysishistorical informationrandom order modelonline generalized assignment problemonline packing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A three-phase matheuristic algorithm for the multi-day task assignment problem

Cites Work

• Unnamed Item
• A stochastic algorithm for online bipartite resource allocation problems
• Online removable knapsack with limited cuts
• Randomized algorithms for online knapsack problems
• Online unweighted knapsack problem with removal cost
• Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching
• A survey of algorithms for the generalized assignment problem
• Stochastic on-line knapsack problems
• Online crowdsourced truck delivery using historical information
• A scalable dynamic parking allocation framework
• A data-driven matching algorithm for ride pooling problem
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
• Task design in complex crowdsourcing experiments: item assignment optimization
• The Dynamic and Stochastic Knapsack Problem
• Geometry of Online Packing Linear Programs
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• The Online Stochastic Generalized Assignment Problem
• A Dynamic Near-Optimal Algorithm for Online Linear Programming
• Online Mechanism Design (Randomized Rounding on the Fly)
• Online Primal-Dual Algorithms for Covering and Packing
• Online Stochastic Packing Applied to Display Ad Allocation
• A Knapsack Secretary Problem with Applications
• A branch and bound algorithm for the generalized assignment problem
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Primal Beats Dual on Online Packing LPs in the Random-Order Model
• Online Knapsack Problem Under Concave Functions
• Online Resource Allocation with Personalized Learning
• Technical Note—Online Hypergraph Matching with Delays
• Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
• Competitive Analysis with a Sample and the Secretary Problem
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• A Survey of the Generalized Assignment Problem and Its Applications

This page was built for publication: Online generalized assignment problem with historical information