Search results for "Bin-Packing"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
153	Nikhil Bansal 0001, Zhen Liu, Arvind Sankar	Bin-packing with fragile objects and frequency allocation in cellular networks.	Wirel. Networks	2009	DBLP DOI BibTeX RDF	Approximation, Wireless communication, Cellular network, Bin-packing, Frequency allocation
141	William Leinberger, George Karypis, Vipin Kumar 0001	Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints.	ICPP	1999	DBLP DOI BibTeX RDF	multiple capacity bin packing, job scheduling, multiple constraints
140	Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang	Strip Packing vs. Bin Packing.	AAIM	2007	DBLP DOI BibTeX RDF
133	Amotz Bar-Noy, Richard E. Ladner, Tami Tamir	Windows scheduling as a restricted version of bin packing.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	approximation algorithms, online algorithms, bin-packing, Periodic scheduling
132	János Csirik, Gerhard J. Woeginger	Resource Augmentation for Online Bounded Space Bin Packing.	ICALP	2000	DBLP DOI BibTeX RDF	asymptotic worst case ratio, approximation algorithm, Online algorithm, competitive analysis, bin packing, resource augmentation
128	Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang 0001	Online Bin Packing of Fragile Objects with Application in Cellular Networks.	WINE	2005	DBLP DOI BibTeX RDF	On-line algorithm, Channel assignment, Bin packing
126	Steven S. Seiden, Rob van Stee	New Bounds for Multidimensional Packing.	Algorithmica	2003	DBLP DOI BibTeX RDF	Box packing, Approximation algorithms, Online algorithms, Bin packing
125	Joan Boyar, Lene M. Favrholdt	The relative worst order ratio for online algorithms.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	dual bin packing, relative worst order ratio, Online, bin packing, quality measure
119	Madan Sathe, Olaf Schenk, Helmar Burkhart	Solving Bi-objective Many-Constraint Bin Packing Problems in Automobile Sheet Metal Forming Processes.	EMO	2009	DBLP DOI BibTeX RDF
119	Fabrice Tercinet, Emmanuel Néron, Christophe Lenté	Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem.	4OR	2006	DBLP DOI BibTeX RDF	MSC classification 90B35, 90C27
119	Nir Menakerman, Raphael Rom	Bin Packing with Item Fragmentation.	WADS	2001	DBLP DOI BibTeX RDF
117	Luitpold Babel, Bo Chen 0002, Hans Kellerer, Vladimir Kotov	On-Line Algorithms for Cardinality Constrained Bin Packing Problems.	ISAAC	2001	DBLP DOI BibTeX RDF	on-line, bin packing, cardinality constraint
112	Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang, Yong Zhang 0001	Online bin packing of fragile objects with application in cellular networks.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	On-line algorithm, Channel assignment, Bin packing
109	Hadas Shachnai, Tami Tamir, Omer Yehezkely	Approximation Schemes for Packing with Item Fragmentation.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Item fragmentation, Algorithms, Linear programming, Bin packing, Polynomial time approximation schemes
103	Nikhil Bansal 0001, Andrea Lodi 0001, Maxim Sviridenko	A Tale of Two Dimensional Bin Packing.	FOCS	2005	DBLP DOI BibTeX RDF
103	Amotz Bar-Noy, Richard E. Ladner, Tami Tamir	Windows scheduling as a restricted version of Bin Packing.	SODA	2004	DBLP BibTeX RDF
101	Nir Naaman, Raphael Rom	Average Case Analysis of Bounded Space Bin Packing Algorithms.	Algorithmica	2008	DBLP DOI BibTeX RDF	Discrete item size distribution, Bounded space, Algorithms, Bin packing, Average case analysis
101	Steven S. Seiden	On the Online Bin Packing Problem.	ICALP	2001	DBLP DOI BibTeX RDF	online algorithms, bin packing
99	Yossi Azar, Oded Regev 0001	On-Line Bin-Stretching.	RANDOM	1998	DBLP DOI BibTeX RDF	bin-stretching, scheduling, approximation algorithms, load balancing, On-line algorithms, bin-packing
96	Leah Epstein, Elena Kleiman	Selfish Bin Packing.	ESA	2008	DBLP DOI BibTeX RDF
96	Leah Epstein	Online Bin Packing with Cardinality Constraints.	ESA	2005	DBLP DOI BibTeX RDF
96	Deshi Ye, Guochuan Zhang	On-Line Extensible Bin Packing with Unequal Bin Sizes.	WAOA	2003	DBLP DOI BibTeX RDF
95	Steven S. Seiden, Rob van Stee	New bounds for multi-dimensional packing.	SODA	2002	DBLP BibTeX RDF
94	Nikhil Bansal 0001, Alberto Caprara, Maxim Sviridenko	Improved approximation algorithms for multidimensional bin packing problems.	FOCS	2006	DBLP DOI BibTeX RDF
94	Alberto Caprara, Andrea Lodi 0001, Michele Monaci	An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem.	IPCO	2002	DBLP DOI BibTeX RDF
94	Justin Benjamin, Bryant A. Julstrom	Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem.	GECCO	2010	DBLP DOI BibTeX RDF	secondary fitness, tie breaking, genetic algorithm, bin packing, tournament selection
94	János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber	On the Sum-of-Squares algorithm for bin packing.	J. ACM	2006	DBLP DOI BibTeX RDF	Approximation algorithms, bin packing, average case analysis
92	Zoran Ivkovic, Errol L. Lloyd	Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps.	ESA	1993	DBLP DOI BibTeX RDF
90	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001	1-Bounded Space Algorithms for 2-Dimensional Bin Packing.	ISAAC	2009	DBLP DOI BibTeX RDF
89	Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk	The Maximum Resource Bin Packing Problem.	FCT	2005	DBLP DOI BibTeX RDF
87	Leah Epstein, Asaf Levin	On Bin Packing with Conflicts.	WAOA	2006	DBLP DOI BibTeX RDF
87	Paul Shaw	A Constraint for Bin Packing.	CP	2004	DBLP DOI BibTeX RDF
86	Edmund K. Burke, Matthew R. Hyde, Graham Kendall, John R. Woodward	Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one.	GECCO	2007	DBLP DOI BibTeX RDF	genetic programming, heuristics, bin packing, hyper heuristics
85	Azer Bestavros, Thomas E. Cheatham, Dan C. Stefanescu	Parallel bin packing using first fit and k-delayed best-fit heuristics.	SPDP	1990	DBLP DOI BibTeX RDF
85	Michael A. Bender, Bryan Bradley, Geetha Jagannathan, Krishnan Pillaipakkamnatt	Sum-of-squares heuristics for bin packing and memory allocation.	ACM J. Exp. Algorithmics	2007	DBLP DOI BibTeX RDF	Bin packing, memory allocation, sum of squares
85	Oana Muntean	Genetically designed heuristics for the bin packing problem.	GECCO (Companion)	2007	DBLP DOI BibTeX RDF	genetic programming, heuristics, bin packing
85	Eung Ju Lee, Hee Yong Youn	Efficient Scheduling by Incorporating Bin Packing with Limited and Weighted Round Robin for Bluetooth.	ICCSA (4)	2006	DBLP DOI BibTeX RDF	LWRR, slot scheduling, Bluetooth, MAC, Bin Packing
85	Steven S. Seiden	On the online bin packing problem.	J. ACM	2002	DBLP DOI BibTeX RDF	online algorithms, Bin packing
84	Rolf Harren, Rob van Stee	Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	two-dimensional bin packing, absolute worst-case ratio, approximation algorithm, strip packing, rectangle packing
83	Silvano Martello, David Pisinger, Daniele Vigo, Edgar den Boef, Jan H. M. Korst	Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.	ACM Trans. Math. Softw.	2007	DBLP DOI BibTeX RDF	branch-and-bound, constraint programming, Bin packing, exact algorithms
83	Claire Kenyon, Michael Mitzenmacher	Linear Waste of Best Fit Bin Packing on Skewed Distributions.	FOCS	2000	DBLP DOI BibTeX RDF	performance index, linear waste, best-fit bin packing, continuous skewed distributions, asymptotic performance ratio, probability, bin packing, discrete distribution
83	Xiaodong Gu, Guoliang Chen 0001, Yinlong Xu	Average-Case Performance Analysis of a 2D Strip Packing Algorithm-NFDH.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	average-case performance ratio, worst-case performance ratio, approximation algorithm, NP-hard, bin packing
81	Edmund K. Burke, Matthew R. Hyde, Graham Kendall	Evolving Bin Packing Heuristics with Genetic Programming.	PPSN	2006	DBLP DOI BibTeX RDF
81	Hadas Shachnai, Omer Yehezkely	Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.	FCT	2007	DBLP DOI BibTeX RDF
81	A. K. Bhatia, Sandip K. Basu	Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic.	ICONIP	2004	DBLP DOI BibTeX RDF	Genetic Algorithm, Heuristics, Bin Packing Problem
80	Edward G. Coffman Jr., George S. Lueker	Approximation Algorithms for Extensible Bin Packing.	J. Sched.	2006	DBLP DOI BibTeX RDF
80	Edward G. Coffman Jr., George S. Lueker	Approximation algorithms for extensible bin packing.	SODA	2001	DBLP BibTeX RDF
79	Hadas Shachnai, Tami Tamir, Omer Yehezkely	Approximation Schemes for Packing with Item Fragmentation.	WAOA	2005	DBLP DOI BibTeX RDF
78	Joseph Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.	Algorithmica	2009	DBLP DOI BibTeX RDF
78	Wolfgang W. Bein, José R. Correa, Xin Han	A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.	ESCAPE	2007	DBLP DOI BibTeX RDF
78	Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yung	On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis.	COCOON	2006	DBLP DOI BibTeX RDF
78	Klaus Jansen	An Approximation Scheme for Bin Packing with Conflicts.	SWAT	1998	DBLP DOI BibTeX RDF
78	Guosong Yu, Guochuan Zhang	Bin Packing of Selfish Items.	WINE	2008	DBLP DOI BibTeX RDF	Nash equilibrium, price of anarchy, Bin packing
78	Yongqiang Shi, Deshi Ye	On-Line Bin Packing with Arbitrary Release Times.	ESCAPE	2007	DBLP DOI BibTeX RDF	Arbitrary release time, On-Line algorithm, Bin packing
77	Leah Epstein, Rob van Stee	This side up!	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	Online algorithms, rotations, bin packing
76	Klaus Jansen, Lars Prädel, Ulrich M. Schwarz	Two for One: Tight Approximation of 2D Bin Packing.	WADS	2009	DBLP DOI BibTeX RDF	approximation, bin packing, rectangle packing
76	Judith O. Berkey, Pearl Y. Wang	A Systolic-Based Parallel Bin Packing Algorithm.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	systolic-based parallel bin packing algorithm, asymptotic error bound, execution performance, serial algorithms, parallel algorithms, computational complexity, approximation algorithm, parallelizations, time complexity, systolic arrays, operations research
76	Mingen Lin, Yang Yang 0012, Jinhui Xu 0001	Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
72	David R. Karger, Krzysztof Onak	Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems.	SODA	2007	DBLP BibTeX RDF
71	János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót	Improved lower bounds for semi-online bin packing problems.	Computing	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 68Q25, 68W40, 68W25
71	Özgür Ülker, Emin Erkan Korkmaz, Ender Özcan	A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing.	PPSN	2008	DBLP DOI BibTeX RDF
69	Laura Cruz Reyes, Diana Maritza Nieto-Yáñez, Pedro Tomás-Solis, Guadalupe Castilla Valdez	Solving Bin Packing Problem with a Hybridization of Hard Computing and Soft Computing.	Innovations in Hybrid Intelligent Systems	2008	DBLP DOI BibTeX RDF	hard computing, genetic algorithms, soft computing, hybrid intelligent system, bin packing problem
69	Philipp Rohlfshagen, John A. Bullinaria	A genetic algorithm with exon shuffling crossover for hard bin packing problems.	GECCO	2007	DBLP DOI BibTeX RDF	exon shuffling, genetic algorithms, bin packing problem
69	Adriana C. F. Alvim, Celso C. Ribeiro, Fred W. Glover, Dario J. Aloise	A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem.	J. Heuristics	2004	DBLP DOI BibTeX RDF	heuristics, combinatorial optimization, tabu search, bin packing
65	Yong He, György Dósa	Bin Packing and Covering Problems with Rejection.	COCOON	2005	DBLP DOI BibTeX RDF
63	Leah Epstein, Asaf Levin	Minimum Weighted Sum Bin Packing.	WAOA	2007	DBLP DOI BibTeX RDF
63	Gürdal Ertek, Kemal Kilic	Decision Support for Packing in Warehouses.	ISCIS	2006	DBLP DOI BibTeX RDF
62	Leah Epstein	Bin Packing with Rejection Revisited.	WAOA	2006	DBLP DOI BibTeX RDF
61	Flávio Keidi Miyazawa, Yoshiko Wakabayashi	Packing Problems with Orthogonal Rotations.	LATIN	2004	DBLP DOI BibTeX RDF
57	Mingen Lin, Yang Yang 0012, Jinhui Xu 0001	On Lazy Bin Covering and Packing Problems.	COCOON	2006	DBLP DOI BibTeX RDF
56	Marco A. Boschetti, Aristide Mingozzi	The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.	4OR	2003	DBLP DOI BibTeX RDF	Lower Bounds, Combinatorial Optimization, Cutting and Packing
56	János Csirik, David S. Johnson, Claire Kenyon	Better approximation algorithms for bin covering.	SODA	2001	DBLP BibTeX RDF
56	Alberto Caprara, Hans Kellerer, Ulrich Pferschy	Approximation Schemes for Ordered Vector Packing Problems.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
56	Hadas Shachnai, Tami Tamir	Polynominal time approximation schemes for class-constrained packing problem.	APPROX	2000	DBLP DOI BibTeX RDF
56	Rohit Gupta, Sumit Kumar Bose, Srikanth Sundarrajan, Manogna Chebiyam, Anirban Chakrabarti	A Two Stage Heuristic Algorithm for Solving the Server Consolidation Problem with Item-Item and Bin-Item Incompatibility Constraints.	IEEE SCC (2)	2008	DBLP DOI BibTeX RDF	bin packing with constraints, graph precoloring, heuristic, graph coloring, server consolidation
56	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar	Packing to angles and sectors.	SPAA	2007	DBLP DOI BibTeX RDF	geometric covering, approximation algorithms, directional antenna, bin packing
55	Cong Liu 0007, Sanjeev Baskiyar	Scheduling Mixed Tasks with Deadlines in Grids Using Bin Packing.	ICPADS	2008	DBLP DOI BibTeX RDF
55	David R. Karger, Jacob Scott 0001	Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
55	Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong	Dynamic Bin Packing of Unit Fractions Items.	ICALP	2005	DBLP DOI BibTeX RDF
55	Nikhil Bansal 0001, Maxim Sviridenko	New approximability and inapproximability results for 2-dimensional Bin Packing.	SODA	2004	DBLP BibTeX RDF
55	Leah Epstein, Steven S. Seiden, Rob van Stee	New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.	ICALP	2002	DBLP DOI BibTeX RDF
55	Saeed Bagheri Shouraki, Gholamreza Haffari	Different Local Search Algorithms in STAGE for Solving Bin Packing Problem.	EurAsia-ICT	2002	DBLP DOI BibTeX RDF
55	Steven S. Seiden	An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing.	ICALP	2000	DBLP DOI BibTeX RDF
55	Sándor P. Fekete, Jörg Schepers	New Classes of Lower Bounds for Bin Packing Problems.	IPCO	1998	DBLP DOI BibTeX RDF
55	C. C. Lee 0002, D. T. Lee	A Simple On-Line Bin-Packing Algorithm	J. ACM	1985	DBLP DOI BibTeX RDF
55	Andrew Chi-Chih Yao	New Algorithms for Bin Packing.	J. ACM	1980	DBLP DOI BibTeX RDF
54	Soukaina Laabadi	Metaheuristic approaches for solving packing problems: 0/1 multidimensional knapsack problem and two-dimensional bin packing problem as examples. (Des approches métaheuristiques pour résoudre les problèmes des chargement: Le problème de sac à dos multidimensionnel binaire et le problème du bin packing bidimensionnel).		2020	RDF
54	Xin Han, Deshi Ye, Yong Zhou	Improved Online Hypercube Packing.	WAOA	2006	DBLP DOI BibTeX RDF
54	Alberto Caprara	Packing 2-Dimensional Bins in Harmony.	FOCS	2002	DBLP DOI BibTeX RDF
54	José R. Correa, Michel X. Goemans	An approximate König's theorem for edge-coloring weighted bipartite graphs.	STOC	2004	DBLP DOI BibTeX RDF	bipartite edge coloring, rearrangeability of 3-stage clos networks, bin packing
53	Guochuan Zhang	Short Communication: Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing.	Computing	1996	DBLP DOI BibTeX RDF	online algorithm, bin packing, Combinatorial problems, worst-case analysis
53	Ramana L. Rao, S. Sitharama Iyengar	A stochastic approach to the bin-packing problem.	SAC	1994	DBLP DOI BibTeX RDF	statistical cooling, simulated annealing, combinatorial optimization, bin-packing, global minimum
53	Peter W. Shor	How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing	FOCS	1991	DBLP DOI BibTeX RDF	2-D strip packing problem, ball packing, average-case online bin packing, expected wasted space, lowest bound, stochastic rightward matching problem, half-infinite strip, online algorithm, tight bounds, rectangle packing
53	Bernard Chazelle	The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	bottom-left heuristic, geometric pattern, scheduling, computational geometry, operating systems, matching, Bin packing, operations research
48	Klaus Jansen, Roberto Solis-Oba	An asymptotic approximation algorithm for 3D-strip packing.	SODA	2006	DBLP DOI BibTeX RDF
48	Leah Epstein	Two Dimensional Packing: The Power of Rotation.	MFCS	2003	DBLP DOI BibTeX RDF
48	Joan Boyar, Lene M. Favrholdt	The Relative Worst Order Ratio for On-Line Algorithms.	CIAC	2003	DBLP DOI BibTeX RDF
47	György Dósa	The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.	ESCAPE	2007	DBLP DOI BibTeX RDF	first fit decreasing, tight bound
47	Riccardo Poli, John R. Woodward, Edmund K. Burke	A histogram-matching approach to the evolution of bin-packing strategies.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
47	E. C. Xavier, Flávio Keidi Miyazawa	The Class Constrained Bin Packing Problem with Applications to Video-on-Demand.	COCOON	2006	DBLP DOI BibTeX RDF