A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Bin Packing with Item Fragmentation
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
%LQ3DFNLQJZLWK,WHP)UDJPHQWDWLRQ 1LU0HQDNHUPDQ 5DSKDHO5RP 'HSDUWPHQWRI(OHFWULFDO(QJLQHHULQJ 7HFKQLRQ±,VUDHO,QVWLWXWHRI7HFKQRORJ\ +DLID,VUDHÔ PQLU#WHFKXQL[URP#HH'WHFKQLRQDFLO $EVWUDFW :H LQYHVWLJDWH D YDULDQW RI WKH ELQ SDFNLQJ SUREOHP LQ ZKLFK LWHPV PD\ EH IUDJPHQWHG LQWR VPDOOHU VL]H SLHFHV FDOOHG IUDJPHQWV :KLOH WKHUH DUH D IHZ DSSOLFDWLRQV WR ELQ SDFNLQJ ZLWK LWHP IUDJPHQWDWLRQ RXU PRGHO RI WKH SUREOHP LV GHULYHGIURPDVFKHGXOLQJSUREOHPSUHVHQWLQGDWDRYHU&$79QHWZRUNV)UDJPHQWLQJ
doi:10.1007/3-540-44634-6_29
fatcat:hzollvccnbaaxfrvyug5rgpxb4
more »
... LWK DFRVWZKLFK UHQGHUVWKHSUREOHP 13 KDUG:HVWXG\WZR SRVVLEOH FRVW IXQFWLRQV DQG DV D UHVXOW JHW WZR YDULDQWV RI ELQ SDFNLQJ ZLWK LWHP IUDJPHQWDWLRQ ,Q WKH ILUVW YDULDQW FDOOHG ELQ SDFNLQJ ZLWK VL]HLQFUHDVLQJ IUDJPHQWDWLRQ ZH DUH DVNHG WR SDFN D OLVW RI LWHPVLQWR D PLQLPXP QXPEHU RI XQLW FDSDFLW\ELQV(DFKLWHPPD\EHIUDJPHQWHGLQZKLFKFDVH RYHUKHDGXQLWVDUHDGGHGWR WKHVL]HRIHYHU\IUDJPHQW,QWKHVHFRQGYDULDQWZH DUHDVNHGWRSDFNDOLVWRILWHPV LQWR D IL[HG QXPEHU RI XQLW FDSDFLW\ ELQV (DFK LWHP KDV D VL]H DQG D FRVW DQG IUDJPHQWLQJ DQ LWHP LQFUHDVHV LWV FRVW EXW GRHV QRW FKDQJH LWV VL]H 7KH JRDO LV WR PLQLPL]H WKH WRWDO FRVW :H FDOO WKLV YDULDQW ELQ SDFNLQJ ZLWK VL]HSUHVHUYLQJ IUDJPHQWDWLRQ :H GHYHORS VHYHUDO DOJRULWKPV IRU WKH SUREOHP RI ELQ SDFNLQJ ZLWK LWHP IUDJPHQWDWLRQDQGLQYHVWLJDWHWKHLUSHUIRUPDQFH7KHDOJRULWKPVZHSUHVHQWDUHEDVHG RQZHOONQRZQELQSDFNLQJ DOJRULWKPV VXFK DV 1H[W )LW DQG )LUVW)LW 'HFUHDVLQJDV ZHOODVRIRWKHUDOJRULWKPV ,QWURGXFWLRQ %HFDXVH RI LWV DSSOLFDELOLW\ WR D ODUJH QXPEHU RI DSSOLFDWLRQV DQG EHFDXVH RI LWV WKHRUHWLFDO LQWHUHVWELQSDFNLQJKDVEHHQZLGHO\UHVHDUFKHGDQGLQYHVWLJDWHGVHHHJ >@>@>@ DQG>@ IRU DFRPSUHKHQVLYHVXUYH\ ,QWKHFODVVLFDORQHGLPHQVLRQDO ELQ SDFNLQJSUREOHPZHDUHJLYHQD OLVW RI LWHPV / D D D Q HDFK ZLWK D VL]H @ VDL DQG DUH DVNHG WR SDFN WKHP LQWR D PLQLPXPQXPEHURIXQLWFDSDFLW\ELQV6LQFHWKHSUREOHPDVPDQ\RILWVGHULYDWLYHVLV13 KDUG PDQ\ DSSUR[LPDWLRQDOJRULWKPVKDYHEHHQGHYHORSHGIRULWVHHHJ >@>@>@ DQG>@ IRUD VXUYH\7KHFRPPRQDVVXPSWLRQLQELQSDFNLQJSUREOHPVLVWKDWDQLWHPPD\QRWEHIUDJPHQWHG LQWRVPDOOHUSLHFHV7KHUHDUHVHYHUDODSSOLFDWLRQVKRZHYHULQZKLFKWKLVDVVXPSWLRQGRHV QRW KROG7KHVXEMHFWRILWHPIUDJPHQWDWLRQLQELQSDFNLQJSUREOHPVUHFHLYHGDOPRVWQRDWWHQWLRQVR
Bin packing with fragmentable items: Presentation and approximations
2015
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We consider a variant of the Bin Packing Problem dealing with fragmentable items. ...
Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. ...
As it can be seen on Fig. 2 , this application also corresponds to a bin packing with fragmentable items. ...
doi:10.1016/j.tcs.2015.08.005
fatcat:75ez3wa4pjdt7c7767kcmpeiqa
Approximation Schemes for Packing with Item Fragmentation
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In bin packing with size preserving fragmentation (BP-SPF), there is a bound on the total number of fragmented items. ...
In bin packing with size increasing fragmentation (BP-SIF), fragmenting an item increases the input size (due to a header/footer of fixed size that is added to each fragment). ...
We consider a variant of BP known as bin packing with item fragmentation (BPF), in which items can be fragmented (into two or more pieces). ...
doi:10.1007/11671411_26
fatcat:ehaofzigtjcjnmtxdnax7zy7iy
Approximation Schemes for Packing with Item Fragmentation
2007
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In bin packing with size preserving fragmentation (BP-SPF), there is a bound on the total number of fragmented items. ...
In bin packing with size increasing fragmentation (BP-SIF), fragmenting an item increases the input size (due to a header/footer of fixed size that is added to each fragment). ...
We consider a variant of BP known as bin packing with item fragmentation (BPF), in which items can be fragmented (into two or more pieces). ...
doi:10.1007/s00224-007-9082-x
fatcat:3lzlzwgp4bgvlkwgt2prsbufsa
Analysis of Transmissions Scheduling with Packet Fragmentation
2001
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We convert the scheduling problem into the problem of bin packing with item fragmentation, which we define in the following way: we are asked to pack a list of items into a minimum number of unit capacity ...
bins. ...
To analyze the scheduling problem we introduce a new variant of bin packing which we call bin packing with item fragmentation. ...
doi:10.46298/dmtcs.277
fatcat:mmral2w3e5colkvmx64tciruxa
A packing problem approach to energy-aware load distribution in Clouds
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This novel generalization is obtained by introducing such constraints as: variable bin size, cost of packing and the possibility of splitting items. ...
We propose to model the energy consumption of private Clouds, which provides virtual computation services, by a variant of the Bin Packing problem. ...
Packing and Item Fragmentation Problem (VS-IF-P). ...
arXiv:1403.0493v1
fatcat:vq3ydgiotjc7fal3rvutbehedu
A packing problem approach to energy-aware load distribution in Clouds
2016
Sustainable Computing: Informatics and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This novel generalization is obtained by introducing such constraints as: variable bin size, cost of packing and the possibility of splitting items. ...
We propose to model the energy consumption of private Clouds, which provides virtual computation services, by a variant of the Bin Packing problem. ...
Packing and Item Fragmentation Problem (VS-IF-P). ...
doi:10.1016/j.suscom.2015.08.001
fatcat:4fzdiqtyyfbl3nfq6t3tyko3v4
Exactly solving packing problems with fragmentation
2016
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In packing problems with fragmentation a set of items of known weight is given, together with a set of bins of limited capacity; the task is to find an assignment of items to bins such that the sum of ...
Arising in diverse application fields, packing with fragmentation has been investigated in the literature from both theoretical, modeling, approximation and exact optimization points of view. ...
Figure 1: Example of packing with item fragmentation: 7 items are packed into 4 bins. Items 2
and 3 are fragmented in a non-primitive solution (left) and in a primitive one (right). ...
doi:10.1016/j.cor.2016.06.007
fatcat:7pefe2qfpfbmvbz2yt6spjq27a
Maximizing data locality in distributed systems
2006
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The ideal resource assignment must balance the utilization of the underlying system against the loss of locality incurred when individual tasks or data objects are fragmented among several servers. ...
We define a packing P as an assignment of every item to the set of bins, given that each item can be fragmented across multiple bins, and similarly, a bin can hold multiple item fragments. ...
An example problem with 4 items and 13 bins. ...
doi:10.1016/j.jcss.2006.07.001
fatcat:lnb55tfdenfqzbkjcdpo2ltz5q
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of the Bin Packing Problem in which each item has a size and a color and the goal is to minimize the sum of the number of bins containing ...
items of each color. ...
Definition 1 ( 1 Bin Packing with Minimum Color Fragmentation). ...
arXiv:1812.00059v1
fatcat:3nmd5qnjpnhu5jbjwylwpyozze
EPTAS for the dual of splittable bin packing with cardinality constraint
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The problem considered is the splittable bin packing with cardinality constraint. ...
Two versions of the splittable bin packing with cardinality constraint have been studied in the literature. ...
The main difference between bin packing with item fragmentation and our problem is that bin packing with item fragmentation usually restricts the number of parts (of an item or total) while our problem ...
arXiv:2204.04685v1
fatcat:7sbevw5qrvf7jj63nheyjgptby
A Constructive Heuristic for the Two-dimensional Bin Packing Problem Based on Value Correction Strategy
2015
Journal of Information and Computational Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper researches on 2D bins packing problems with guillotine-cut constraints. ...
Four successful ideas are combined into a single coherent heuristic: (1) combining narrow items into a block and then packing it as a single item, (2) slicing the bin space into shelves and packing items ...
., firstly packing items into shelves, secondly packing shelves into bins. Shelves are rectangles with varying heights and with width the same as the bin width. Lodi et al. ...
doi:10.12733/jics20106371
fatcat:svjilg27rfcxzhluwuj6hwaqui
AUTOMATIC SCALING OF WEB APPLICATIONS FOR CLOUD COMPUTING SERVICES: A REVIEW
2014
International Journal of Research in Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
So every application instance encapsulated inside virtual machine and model it as the Class Constraint Bin Packing (CCBP) problem. ...
Where each class represents an application and each server is a bin and uses virtualization technology for fault isolation. Now many business customers need good satisfy response services from cloud. ...
And if suppose all bin are full with color set then new bin is opened to board the item. ...
doi:10.15623/ijret.2014.0311072
fatcat:2athjjhwmbf77kp75dbgsb3cvi
A Constructive Heuristic for Two-Dimensional Bin Packing
2013
Advanced Materials Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Two-dimensional bin packing is encountered in various applications where small rectangular items are packed into a minimum number of large rectangular objects (bins). ...
Aiming at an optimal area utilization, the paper presents an effective constructive heuristic approach to two-dimensional bin packing. ...
The other is the remaining area which can be used to pack items. The more the items are packed, the more waste areas are produced. Moreover, the remaining areas become fragmented with partitioning. ...
doi:10.4028/www.scientific.net/amr.756-759.2705
fatcat:ot644u7lhrbxpa5pnkp76cim64
Content-based layout optimization
2019
International Conference on Intelligent User Interfaces
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
With improved content consumption tracking via web analytics, such personalization is not only feasible but also valuable for a content publisher/owner with large volumes of content to choose from. ...
In this paper, we propose a genetic algorithm based framework that chooses a subset of content items (from a large collection) that are relevant to a given user and determines their respective sizes and ...
Bin packing [3, 9] is a class of algorithms for the assignment of pre-selected items to locations. ...
dblp:conf/iui/SrinivasanVC19a
fatcat:mh5nckl64zazfbhu4dfk2npyse
« Previous
Showing results 1 — 15 out of 4,617 results