Online algorithms with advice for the dual bin packing problem

DOI10.1007/s10100-016-0450-yzbMath1390.90480OpenAlexW2481908560MaRDI QIDQ1642809

Marc P. Renault

Publication date: 15 June 2018

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-016-0450-y

zbMATH Keywords

competitive analysisonline algorithmsdual bin packingonline computation with advicemultiple knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Editorial ⋮ Online bin covering with advice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online knapsack revisited
• Online bin packing with advice
• Online algorithms with advice for bin packing and scheduling problems
• Online computation with advice
• Fair versus unrestricted bin packing
• Bin packing: Maximizing the number of pieces packed
• Semi on-line algorithms for the partition problem
• On online algorithms with advice for the \(k\)-server problem
• Online makespan minimization with parallel schedules
• The online knapsack problem: advice and randomization
• The Accommodating Function: A Generalization of the Competitive Ratio
• Reordering Buffer Management with Advice
• Online Bin Packing with Advice of Small Size
• On the Advice Complexity of Buffer Management
• Online Stochastic Matching: Beating 1-1/e
• Online bipartite matching with random arrivals

This page was built for publication: Online algorithms with advice for the dual bin packing problem