A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (Q610980): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-008-0452-9 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-008-0452-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030744036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating column generation for variable sized bin-packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ship routing and scheduling with flexible cargo sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation approaches to ship scheduling with flexible cargo sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the variable size bin packing problem with discretized formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the variable sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and bounds for two-dimensional level packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for packing and scheduling problems. (Abstract of thesis) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anomalous behavior in bin packing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-008-0452-9 / rank
 
Normal rank

Latest revision as of 22:26, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
scientific article

    Statements

    A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint (English)
    0 references
    0 references
    0 references
    0 references
    13 December 2010
    0 references
    bin packing
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    0 references
    0 references
    0 references

    Identifiers