Filters








15,218 Hits in 3.2 sec

New models of graph-bin packing

Cs. Bujtás, Gy. Dósa, Cs. Imreh, J. Nagy-György, Zs. Tuza
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
In this paper we propose two online versions of the Graph-Bin packing problem.  ...  Computer Sci. 22 (2011) 1971-1993 the authors introduced a very general problem called Graph-Bin Packing (GBP).  ...  Since bin packing and graph homomorphism are highly important instances of our problem, we named it graph-bin packing, or graph H-bin packing when the underlying structure (host graph) H has to be mentioned  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2016.06.008">doi:10.1016/j.tcs.2016.06.008</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fuoo65vzunan5lt7oafb4fwfey">fatcat:fuoo65vzunan5lt7oafb4fwfey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722071340/http://real.mtak.hu/44390/7/44390.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b7/93/b793dee8c03537a370d579d28e5e5e81741b351f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2016.06.008"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Bin packing and cutting stock problems: Mathematical models and exact algorithms

Maxence Delorme, Manuel Iori, Silvano Martello
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2fqqu5s6wbgk5gcucpt3wqm3gy" style="color: black;">European Journal of Operational Research</a> </i> &nbsp;
2 0 2 3 4 5 6 7 8 9 2 2 2 Delorme, Iori, Martello Bin Packing and Cutting Stock Problems BOLOGNA 2015 28 / 35 Model min z (6) s.t. − d∈δ − (e) Delorme, Iori, Martello  ...  A new linear programming approach to the cutting stock problem, Operations Research 1981 Valerio de Carvalho, Exact solution of bin-packing problems using column generation and branch-and-bound, Annals  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2016.04.030">doi:10.1016/j.ejor.2016.04.030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dvyh7t2kfzffhm4kkr4zecswau">fatcat:dvyh7t2kfzffhm4kkr4zecswau</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200709222003/https://santini.in/files/seminars/spring-2015/md_slides.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/7a/887a453fe28c57cea09a4f2f7ea9d86b6ddff94e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ejor.2016.04.030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

VPSolver 3: Multiple-choice Vector Packing Solver [article]

Filipe Brandão
<span title="2016-02-16">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
VPSolver is a vector packing solver based on an arc-flow formulation with graph compression.  ...  In this paper, we present the algorithm introduced in VPSolver 3.0.0 for building compressed arc-flow models for the multiple-choice vector packing problem.  ...  Property 2 (Equivalence to the pattern-based model) For a graph with all valid packing patterns represented as paths from s to t t for each bin type t, model (1)-(6) is equivalent, in terms of lower bound  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.04876v1">arXiv:1602.04876v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tfwwn3cgunclditmmmnehrabrq">fatcat:tfwwn3cgunclditmmmnehrabrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191018140740/https://arxiv.org/pdf/1602.04876v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/68/eb68d9400672dee803ba17b2fb2db4aaf97a5226.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.04876v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Bin packing with directed stackability conflicts

Attila Bódis
<span title="2015-06-01">2015</span> <i title="Walter de Gruyter GmbH"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3eqv6evtubbcxlmaovdwd4jg2i" style="color: black;">Acta Universitatis Sapientiae: Informatica</a> </i> &nbsp;
Two new models are introduced for this problem: Bin Packing Problem with Hanoi Conflicts (BPPHC) and Bin Packing Problem with Directed Conflicts (BPPDC).  ...  The corresponding model in the literature is the Bin Packing Problem with Conflicts (BPPC), where this additional constraint is defined by an undirected conflict graph having edges between items that cannot  ...  The Bin Packing Problem with Conflicts model is very general as basically any kind of graph can be used as a valid conflict graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/ausi-2015-0011">doi:10.1515/ausi-2015-0011</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wptu4l6ydjb25ky6kkkiiiqohe">fatcat:wptu4l6ydjb25ky6kkkiiiqohe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502182216/https://content.sciendo.com/downloadpdf/journals/ausi/7/1/article-p31.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f0/8a/f08a00aad05f53fbcfb66daabe23cd5bb71aa3bc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1515/ausi-2015-0011"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> degruyter.com </button> </a>

Propagating the Bin Packing Constraint Using Linear Programming [chapter]

Hadrien Cambazard, Barry O'Sullivan
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, with the filtering of the bin packing constraint.  ...  The state-of-the-art global constraint for bin packing is due to Shaw.  ...  Any path in this graph corresponds to a packing of a single bin.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15396-9_13">doi:10.1007/978-3-642-15396-9_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5r2inqhajvgkvgjqlsh7dhfz6i">fatcat:5r2inqhajvgkvgjqlsh7dhfz6i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810005556/http://pagesperso.g-scop.grenoble-inp.fr/~cambazah/page2/assets/binpacking_final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/77/de/77de6ccd8e7a9e395a2aaef5c5dc494b10fc1810.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15396-9_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression [article]

Filipe Brandão, João Pedro Pedroso
<span title="2013-10-25">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model.  ...  In this paper, we deal with vector packing, graph coloring, bin packing, cutting stock, cardinality constrained bin packing, cutting stock with cutting knife limitation, cutting stock with binary patterns  ...  Bin packing with conflicts The bin packing packing with conflicts (BPPC) is one of the most import bin packing variants. This problem consists of the combination of bin packing with graph coloring.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.6887v1">arXiv:1310.6887v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q6nt6wkdfbhzvc5jzvs46ora4i">fatcat:q6nt6wkdfbhzvc5jzvs46ora4i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200828062411/https://arxiv.org/pdf/1310.6887v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9d/57/9d57cb5892ff32526f63fac6bea2a3ecd4ab7154.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1310.6887v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Bin packing and related problems: General arc-flow formulation with graph compression

Filipe Brandão, João Pedro Pedroso
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zfqmu5yfvjbg3f4h6f7a5j3jr4" style="color: black;">Computers &amp; Operations Research</a> </i> &nbsp;
Our method includes a graph compression algorithm that usually reduces the size of the underlying graph substantially without weakening the model.  ...  In this paper, we deal with vector packing, graph coloring, bin packing, cutting stock, cardinality constrained bin packing, cutting stock with cutting knife limitation, cutting stock with binary patterns  ...  Bin packing with conflicts The bin packing packing with conflicts (BPPC) is one of the most import bin packing variants. This problem consists of the combination of bin packing with graph coloring.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cor.2015.11.009">doi:10.1016/j.cor.2015.11.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fmk6xkmiuzhmfefo26lltni5q4">fatcat:fmk6xkmiuzhmfefo26lltni5q4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20141022020356/http://www.dcc.fc.up.pt/dcc/Pubs/TReports/TR13/dcc-2013-08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/5b/ed5b126357b593a15a1b0d1fed947814c73689c5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.cor.2015.11.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Parallelism versus memory allocation in pipelined router forwarding engines

Fan Chung, Ronald Graham, George Varghese
<span title="">2004</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA &#39;04</a> </i> &nbsp;
The proof utilizes a new bin packing model, which is interesting in its own right.  ...  Instead, in this paper we show that perfect memory sharing of shared memory can be achieved with a collection of two-port memories, as long as the number of processors is less than the number of memories  ...  Acknowledgments The authors thank John Holst of Procket Corporation who built the hardware to implement the model described in this paper and whose initial ideas about memory allocation were the genesis  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1007912.1007928">doi:10.1145/1007912.1007928</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/ChungGV04.html">dblp:conf/spaa/ChungGV04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ozi7qcv7rhi3a2w4wnnbtebxy">fatcat:7ozi7qcv7rhi3a2w4wnnbtebxy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705063051/http://cseweb.ucsd.edu/%7Evarghese/PAPERS/theorycompsys2006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/13/5313e96b048fe52ff32cdd0dbb32ee88ee6bdec3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1007912.1007928"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines

Fan Chung, Ronald Graham, Jia Mao, George Varghese
<span title="2006-09-29">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a> </i> &nbsp;
The proof utilizes a new bin packing model, which is interesting in its own right.  ...  Instead, in this paper we show that perfect memory sharing of shared memory can be achieved with a collection of two-port memories, as long as the number of processors is less than the number of memories  ...  Acknowledgments The authors thank John Holst of Procket Corporation who built the hardware to implement the model described in this paper and whose initial ideas about memory allocation were the genesis  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-006-1249-3">doi:10.1007/s00224-006-1249-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rboouyrhmfbedjrgb2p5ozrcty">fatcat:rboouyrhmfbedjrgb2p5ozrcty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705063051/http://cseweb.ucsd.edu/%7Evarghese/PAPERS/theorycompsys2006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/13/5313e96b048fe52ff32cdd0dbb32ee88ee6bdec3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-006-1249-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Partitioning bin-packing algorithms for distributed real-time systems

Dionisio De Niz, Raj Rajkumar
<span title="">2006</span> <i title="Inderscience Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hhqqcmmov5gohko27pwftemxtu" style="color: black;">International Journal of Embedded Systems</a> </i> &nbsp;
In this paper, we study Partitioning Bin Packing, an extension to bin-packing algorithms to exploit the capability of partitioning software modules into smaller pieces.  ...  We have developed a model-based tool called Time Weaver which enables the modeling of functional and para-functional behaviors of real-time systems.  ...  Then, each connected graph component is treated as a composite object that can be partitioned and assigned by the bin-packing scheme. In classical bin-packing, bins are of unit size.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijes.2006.014855">doi:10.1504/ijes.2006.014855</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lkmo2l4du5gxvdufmnfadcd6lm">fatcat:lkmo2l4du5gxvdufmnfadcd6lm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060924233524/http://www.cs.cmu.edu/afs/cs/project/rtml-2/Papers/IJES/pbfd.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/25/1d/251d787187b72b7ba9c0c9c8cb3545efa8ca18ae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijes.2006.014855"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

BinPacker: Packing-Based De Novo Transcriptome Assembly from RNA-seq Data

Juntao Liu, Guojun Li, Zheng Chang, Ting Yu, Bingqiang Liu, Rick McMullen, Pengyin Chen, Xiuzhen Huang, Thomas Lengauer
<span title="2016-02-19">2016</span> <i title="Public Library of Science (PLoS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ch57atmlprauhhbqdf7x4ytejm" style="color: black;">PLoS Computational Biology</a> </i> &nbsp;
corresponding isoforms by solving a series of bin-packing problems.  ...  In this study, we present a novel de novo assembler, Bin-Packer, by modeling the transcriptome assembly problem as tracking a set of trajectories of items with their sizes representing coverage of their  ...  Bin packing BinPacker iteratively calls a variant of bin packing model to comb all the transcripts encoded in a splicing graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pcbi.1004772">doi:10.1371/journal.pcbi.1004772</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/26894997">pmid:26894997</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4760927/">pmcid:PMC4760927</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/eevd6gozwvahvdhmzznkbtftam">fatcat:eevd6gozwvahvdhmzznkbtftam</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171015152536/http://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1004772&amp;type=printable" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/2a/822a6a425cc7a79abfa8bf5db406c5072714583e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1371/journal.pcbi.1004772"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> plos.org </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4760927" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Bin Packing Game with an Interest Matrix [chapter]

Zhenbo Wang, Xin Han, György Dósa, Zsolt Tuza
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we study a game problem, called bin packing game with an interest matrix, which is a generalization of all the currently known bin packing games.  ...  The payoff of item i is the sum of aij over all items j in the same bin with item i, and each item wants to stay in a bin where it can fit and its payoff is maximized.  ...  Generalized Bin Packing Game. We introduce a new type of bin packing games.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21398-9_5">doi:10.1007/978-3-319-21398-9_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/idjyttfnvraxdasuyr6nuoskui">fatcat:idjyttfnvraxdasuyr6nuoskui</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830064721/http://faculty.math.tsinghua.edu.cn/~zwang/upload/COCOON15-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/75/2f/752f6c53ae57cd4771f97f864692fbdbfadcfee9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21398-9_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On the packing of selfish items

V. Bilo
<span title="">2006</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t3x4vqewrncrfgn2wu7cafsbsq" style="color: black;">Proceedings 20th IEEE International Parallel &amp; Distributed Processing Symposium</a> </i> &nbsp;
In the non cooperative version of the classical Minimum Bin Packing problem, an item is charged a cost according to the percentage of the used bin space it requires.  ...  We study the game induced by the selfish behavior of the items which are interested in being packed in one of the bins so as to minimize their cost.  ...  Theorem 4. 2 2 The extended bin packing game may not admit a pure Nash equilibrium even for the case in which all bins have the same cost and all the allowed paths in the underlying graph are of the same  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2006.1639283">doi:10.1109/ipdps.2006.1639283</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ipps/Bilo06.html">dblp:conf/ipps/Bilo06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mrdn2jeav5bizim2ehnm44rnxa">fatcat:mrdn2jeav5bizim2ehnm44rnxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100621181229/http://www.cecs.uci.edu/~papers/ipdps06/pdfs/1568974382-IPDPS-paper-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/2d/682dd9c3040f1f35c83990fa24a69f7721613e08.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ipdps.2006.1639283"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Towards Bin Packing (preliminary problem survey, models with multiset estimates) [article]

Mark Sh. Levin
<span title="2016-05-24">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The paper described a generalized integrated glance to bin packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items.  ...  A new systemic viewpoint to bin packing problems is suggested: (a) basic element sets (item set, bin set, item subset assigned to bin), (b) binary relation over the sets: relation over item set as compatibility  ...  packing problems (e.g., various color proximities, various objective functions); 3. examination of multi-stage bin packing problems (i.e., models, methods, applications); 4. examination of new applied  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.07574v1">arXiv:1605.07574v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/inhdwvq6kzhzrad5uv4qo27ami">fatcat:inhdwvq6kzhzrad5uv4qo27ami</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200829034427/https://arxiv.org/pdf/1605.07574v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/78/62/7862f7667e267981eed3db1f6ba16cf6d07956a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1605.07574v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Algorithms for the Bin Packing Problem with Conflicts

Albert E. Fernandes Muritiba, Manuel Iori, Enrico Malaguti, Paolo Toth
<span title="">2010</span> <i title="Institute for Operations Research and the Management Sciences (INFORMS)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ko3yoz32wja7tmqwbgqqjmfyxa" style="color: black;">INFORMS journal on computing</a> </i> &nbsp;
Heuristics and lower bounds for the bin packing problem with conficts. (2004)  The cardinality of any clique of the incompatibility graph G represents a LB for the problem.  ...  I = family of all the subsets of V representing feasible bins Binary LP relaxation of Model (6) -(8), get z*.  ...  If the solution of the continuous relaxation of model (6) -(8) is not integer, we embed the column generation algorithm in a branching scheme, thus obtaining a Branch&Price algorithm. • We branch on  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ijoc.1090.0355">doi:10.1287/ijoc.1090.0355</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/amnmb7wlfbhqzhze7ssq2c5utm">fatcat:amnmb7wlfbhqzhze7ssq2c5utm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810224328/http://www.iwr.uni-heidelberg.de/groups/comopt/conferences/aussois2009/slides/malaguti.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3e/66/3e661e90f089d0d54374c31f8e3c0fbcbf444089.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1287/ijoc.1090.0355"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 15,218 results