Online multi-dimensional generalized assignment problem with predictions

DOI10.1016/J.TCS.2025.115505MaRDI QIDQ6903548zbMATH OpenFDO

Authors Yimeng Xu, Jiaqi Zheng, Guihai Chen, Xia Zhu, Zhen Yao

Publication date 10 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115505

zbMATH Keywords

competitive ratiominimum-weight complete matchingmulti-dimensional generalized assignment problemonline algorithm

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Cites work

• A 2-competitive algorithm for online convex optimization with switching costs
• A branch and bound algorithm for the generalized assignment problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Adjustable robust solutions of uncertain linear programs
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Approximation algorithms for scheduling unrelated parallel machines
• Bees algorithm for generalized assignment problem
• Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
• Exact solution methods for a generalized assignment problem with location/allocation considerations
• Online stochastic packing applied to display ad allocation
• Robust convex optimization
• Robust optimization
• Solving a real world assignment problem with a metaheuristic
• The design of approximation algorithms
• The online stochastic generalized assignment problem

This page was built for publication: Online multi-dimensional generalized assignment problem with predictions

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