Geeky holidaymakers wanting to take more on a trip, as well as delivery firms trying to maximise loads and storage, could benefit from a new algorithm that packs collections of differently sized 2D ...
bin-packing-algorithms is a partial remake of a project developed during an investigation scholarship I did in my freshman year at Universidade de Coimbra (Visualization of Cutting & Packing Problems) ...
ABSTRACT: Two-Dimensional Irregular Strip Packing Problem is a classical cutting/packing problem. The problem is to assign, a set of 2-D irregular-shaped items to a rectangular sheet. The width of the ...
This repository contains the implementation code for the paper "Fast algorithms for a large scale file aggregation problem" submitted to a scientific journal. The project implements and evaluates ...
ABSTRACT: Two-Dimensional Irregular Strip Packing Problem is a classical cutting/packing problem. The problem is to assign, a set of 2-D irregular-shaped items to a rectangular sheet. The width of the ...
Abstract: Rectangle packing is a well studied NP-complete problem in which smaller rectangles are packed in an enclosing larger rectangle to minimize wastage of space. Rectangle packing is used in ...
In this paper, we give the first robust algorithms for Packing Integer Programs, specifically in the recently proposed Byzantine Secretary framework. Our techniques are based on a two-level use of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results