Online generalized assignment problem with historical information

DOI10.1016/J.COR.2022.106047MaRDI QIDQ2108140zbMATH OpenOpenAlexFDO

Authors Haodong Liu, Huili Zhang, Kelin Luo, Yao Xu, Weitian Tong, Yinfeng 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 informationonline generalized assignment problemonline packing problemrandom order model

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Learn from history for online bipartite matching
• Competitive strategies for an online generalized assignment problem with a service consecution constraint
• The online stochastic generalized assignment problem
• Primal beats dual on online packing LPs in the random-order model

Cites work

• A branch and bound algorithm for the generalized assignment problem
• A data-driven matching algorithm for ride pooling problem
• A dynamic near-optimal algorithm for online linear programming
• A Knapsack Secretary Problem with Applications
• A scalable dynamic parking allocation framework
• A stochastic algorithm for online bipartite resource allocation problems
• A survey of algorithms for the generalized assignment problem
• A Survey of the Generalized Assignment Problem and Its Applications
• Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• Average-Case Analysis of Off-Line and On-Line Knapsack Problems
• Competitive Analysis with a Sample and the Secretary Problem
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
• Online crowdsourced truck delivery using historical information
• Online Knapsack Problem Under Concave Functions
• Online mechanism design (randomized rounding on the fly)
• Online primal-dual algorithms for covering and packing
• Online removable knapsack with limited cuts
• Online resource allocation with personalized learning
• Online stochastic packing applied to display ad allocation
• Online unweighted knapsack problem with removal cost
• Primal beats dual on online packing LPs in the random-order model
• Randomized algorithms for online knapsack problems
• Stochastic on-line knapsack problems
• Task design in complex crowdsourcing experiments: item assignment optimization
• Technical note -- Online hypergraph matching with delays
• The dynamic and stochastic knapsack problem
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• The online stochastic generalized assignment problem
• The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach

Cited in

(4)

• Learn from history for online bipartite matching
• Online crowdsourced truck delivery using historical information
• An on-line assignment problem with random effectiveness and costly information
• A three-phase matheuristic algorithm for the multi-day task assignment problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108140)