Minimum Weighted Sum Bin Packing

DOI10.1007/978-3-540-77918-6_18zbMath1130.90039OpenAlexW1573837192MaRDI QIDQ5443385

Asaf Levin, Leah Epstein

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_18

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

A branch-and-bound approach for a vehicle routing problem with customer costs ⋮ Improved analysis of two algorithms for min-weighted sum bin packing ⋮ A routing and scheduling approach to rail transportation of hazardous materials with demand due dates ⋮ Min-sum bin packing

Cites Work

• Unnamed Item
• Min-sum bin packing
• Bin packing can be solved within 1+epsilon in linear time
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Approximating min sum set cover
• Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
• Database Theory - ICDT 2005

This page was built for publication: Minimum Weighted Sum Bin Packing