scientific article
From MaRDI portal
Publication:2957914
DOI10.4230/LIPIcs.STACS.2013.538zbMath1354.68118MaRDI QIDQ2957914
Publication date: 30 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (47)
Single machine scheduling with job delivery to multiple customers ⋮ Online bin packing with overload cost ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Online Colored Bin Packing ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Black and White Bin Packing Revisited ⋮ Optimal energy-efficient placement of virtual machines with divisible sizes ⋮ Batched bin packing revisited ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Open-end bin packing: new and old analysis approaches ⋮ Bin packing under linear constraints ⋮ Maximizing the minimum load: the cost of selfishness ⋮ Bin packing problem with scenarios ⋮ Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Using weight decision for decreasing the price of anarchy in selfish bin packing games ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ Improved analysis of two algorithms for min-weighted sum bin packing ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Colored bin packing: online algorithms and lower bounds ⋮ Online two-dimensional vector packing with advice ⋮ Bin packing game with a price of anarchy of \(\frac{3}{2}\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ A bin packing game with cardinality constraints under the best cost rule ⋮ On bin packing with clustering and bin packing with delays ⋮ Best fit bin packing with random order revisited ⋮ The optimal absolute ratio for online bin packing ⋮ The intermediate price of anarchy (IPoA) in bin packing games ⋮ A general bin packing game: interest taken into account ⋮ Max-min bin packing algorithm and its application in nano-particles filling ⋮ Online packing of arbitrary sized items into designated and multipurpose bins ⋮ More on batched bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Batch scheduling of nonidentical job sizes with minsum criteria ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ A heuristic algorithm for solving triangle packing problem ⋮ Capacitated vehicle routing problem on line with unsplittable demands ⋮ Bin packing with directed stackability conflicts ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Online results for black and white bin packing ⋮ A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line ⋮ Offline black and white bin packing ⋮ The tight absolute bound of First Fit in the parameterized case
This page was built for publication:
