A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2016.12.021 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2564312101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme Point-Based Heuristics for Three-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search for the Three-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Bin Packing Problem with Conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the variable sized bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic approximation scheme for the concave cost bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin‐packing problem with concave costs of bin utilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the one-dimensional bin packing problem with a weight annealing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for IP column generation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2016.12.021 / rank
 
Normal rank

Latest revision as of 08:22, 11 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
scientific article

    Statements

    A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    packing
    0 references
    2D vector packing
    0 references
    piecewise linear cost function
    0 references
    branch-and-price
    0 references
    column generation
    0 references

    Identifiers