X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
operations research & management science (40) 40
algorithms (34) 34
analysis (19) 19
lower bounds (18) 18
mathematics, applied (18) 18
optimization (18) 18
computer science (17) 17
operations research (16) 16
studies (13) 13
bin packing (12) 12
computer science, theory & methods (12) 12
index medicus (12) 12
dual bin packing (11) 11
dual version (11) 11
dual feasible functions (10) 10
mathematical models (10) 10
column generation (9) 9
combinatorial analysis (9) 9
mathematics (9) 9
operations research/decision theory (9) 9
skiving stock problem (9) 9
algorithm (8) 8
cutting and packing (8) 8
online algorithms (8) 8
approximation algorithms (7) 7
calculus of variations and optimal control; optimization (7) 7
chemistry, multidisciplinary (7) 7
computer science, interdisciplinary applications (7) 7
dual bin-packing (7) 7
dual-feasible functions (7) 7
inequalities (7) 7
mathematical analysis (7) 7
online (7) 7
scheduling (7) 7
computer science, software engineering (6) 6
models (6) 6
packing (6) 6
packing problem (6) 6
research (6) 6
usage (6) 6
bin packing problem (5) 5
bins (5) 5
competitive analysis (5) 5
cutting-stock problem (5) 5
engineering, industrial (5) 5
engineering, manufacturing (5) 5
integer programming (5) 5
mathematical optimization (5) 5
methods (5) 5
optimization techniques, programming models, dynamic analysis (5) 5
[info.info-ro]computer science [cs]/operations research [cs.ro] (4) 4
aggregation-induced emission (4) 4
asymptotic properties (4) 4
bin covering (4) 4
bin-packing (4) 4
business and management (4) 4
combinatorial optimization (4) 4
cutting stock problem (4) 4
economics / management science (4) 4
gap (4) 4
humans (4) 4
linear programming (4) 4
materials science, multidisciplinary (4) 4
programming (4) 4
science & technology (4) 4
stabilization (4) 4
theoretical computer science (4) 4
theory of computation (4) 4
[ info.info-ro ] computer science [cs]/operations research [cs.ro] (3) 3
additive integrality gap (3) 3
artificial intelligence (3) 3
availability (3) 3
biophysics (3) 3
bounds (3) 3
chemistry, physical (3) 3
cloud computing (3) 3
clustering (3) 3
combinatorics (3) 3
computation (3) 3
computational theory and mathematics (3) 3
computer science, hardware & architecture (3) 3
computer science, information systems (3) 3
coupling (3) 3
derivatives (3) 3
dynamics (3) 3
engineering, electrical & electronic (3) 3
fluorescence (3) 3
genetic algorithm (3) 3
integer round-down property (3) 3
integers (3) 3
knapsack problem (3) 3
linear-programming approach (3) 3
luminescence (3) 3
mathematics of computing (3) 3
maximal functions (3) 3
metal (3) 3
modeling (3) 3
nanoparticles (3) 3
nanoscience & nanotechnology (3) 3
phosphorescence (3) 3
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Global Optimization, ISSN 0925-5001, 7/2019, Volume 74, Issue 3, pp. 467 - 476
We consider the one-dimensional skiving stock problem, also known as the dual bin packing problem, with the aim of maximizing the best known dual and proper... 
Cutting stock problem | Operations Research/Decision Theory | Equivalence of classes | Integer round-up property | Bin packing problem | Mathematics | Computer Science, general | Skiving stock problem | Optimization | Dual bin packing problem | Real Functions | Proper gap | Marx, Karl (German political theorist) | Cutting
Journal Article
Central European Journal of Operations Research, ISSN 1435-246X, 12/2017, Volume 25, Issue 4, pp. 953 - 966
This paper studies the problem of maximizing the number of items packed into n bins, known as the dual bin packing problem, in the advice per request model. In... 
Online algorithms | Business and Management | Competitive analysis | Dual bin packing | Operations Research/Decision Theory | Multiple knapsack problem | Online computation with advice | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Ratios | Operations research | Algorithms | Scheduling algorithms | Bins
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 03/2013, Volume 225, Issue 2, pp. 244 - 252
► We propose new lower bounds that dominate all lower bounds from the literature. ► We present a strictly better example to emphasize the difference between... 
Bin packing | Lower bounds | Combinatorial optimization | Three dimensional | DUAL-FEASIBLE FUNCTIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | REDUCTION PROCEDURES | Operational research | Asymptotic properties | Computation | Combinatorial analysis
Journal Article
Mathematical Programming, ISSN 0025-5610, 10/2001, Volume 91, Issue 1, pp. 11 - 31
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 12/2018, Volume 271, Issue 2, pp. 401 - 419
•Unified branch-and-price for vector packing problems.•Column-generation subproblems are multidimensional knapsack problems.•Subproblems are solved as... 
Cutting | Shortest path problem with resource constraints | Stabilization | Dual-optimal inequalities | Vector packing | COLUMN GENERATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | INEQUALITIES | LOWER BOUNDS | BIN-PACKING | RESOURCE CONSTRAINTS | CUTTING-STOCK PROBLEM | Decision-making | Usage | Mathematical optimization | Analysis | Methods | Logistics
Journal Article
Performance Evaluation Review, ISSN 0163-5999, 06/2015, Volume 43, Issue 1, pp. 467 - 468
Conference Proceeding
Theoretical Computer Science, ISSN 0304-3975, 10/2006, Volume 362, Issue 1-3, pp. 127 - 139
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size... 
Bin packing | Approximation | On-line | Dual bin packing | dual bin packing | approximation | COMPUTER SCIENCE, THEORY & METHODS | bin packing | on-line | Computer science | Algorithms
Journal Article
Information and Computation, ISSN 0890-5401, 2008, Volume 206, Issue 8, pp. 1003 - 1016
Journal Article
Computer Science Review, ISSN 1574-0137, 05/2017, Volume 24, pp. 63 - 79
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2014, Volume 556, Issue C, pp. 71 - 84
Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total... 
Online algorithms | Bin covering | Performance measures | Competitive analysis | DUAL VERSION | PACKING | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | PERFORMANCE-MEASURES | Computer science | Analysis | Algorithms | Bins | Covering | Online | Order disorder | Strength | Combinatorial analysis
Journal Article
International Journal of Production Research: Cutting Edge Production Research of the French Community, ISSN 0020-7543, 01/2009, Volume 47, Issue 2, pp. 537 - 560
The bin-packing problem consists of determining the minimum number of bins needed to pack a given set of n items. It has been shown that the dual-feasible... 
Bin-packing | Dual-feasible functions | Data-dependent dual-feasible functions | SCHEDULING PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | FIXED ORIENTATION | ENGINEERING, MANUFACTURING | ENGINEERING, INDUSTRIAL
Journal Article
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 06/2016, Volume 251, Issue 2, pp. 356 - 368
•The formulation of three new models for the one-dimensional skiving stock problem.•The equivalence of the continuous relaxations (standard, arcflow and... 
Continuous relaxation | Packing | Skiving stock problem | Dual bin packing | Modeling | COLUMN GENERATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | DUAL BIN-PACKING | ALGORITHMS | Linear programming | Analysis | Integer programming | Usage | Availability | Equivalence | Joining | Mathematical models | Raw materials | Operational research | Optimization
Journal Article
Information Processing Letters, ISSN 0020-0190, 2008, Volume 109, Issue 1, pp. 32 - 37
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the... 
Bin packing | Approximation algorithms | DUAL VERSION | COMPUTER SCIENCE, INFORMATION SYSTEMS | TIME | Algorithms
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2010, Volume 206, Issue 2, pp. 281 - 288
Journal Article
Discrete Optimization, ISSN 1572-5286, 2005, Volume 2, Issue 3, pp. 201 - 218
In this paper, we investigate fast lower bounds for the deterministic one-dimensional bin packing problem. We present two variants of a general lifting... 
Dual feasible functions | Bin packing | Lower bounds
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 2/2010, Volume 46, Issue 2, pp. 246 - 260
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are... 
Online algorithms | Computational Mathematics and Numerical Analysis | Theory of Computation | Bin covering | Computer Science | MATHEMATICS | DUAL VERSION | PACKING | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | Analysis | Algorithms | Studies | Computer science | Polynomials | Approximations
Journal Article
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.