An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2021.10.011 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3206518727 / 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: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing / 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: A two-dimensional vector packing model for the efficient use of coil cassettes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with general cost structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized branch-and-price algorithms for vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / 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: A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing / 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: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for the bin packing problem and their relationships to various construction heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved branch-cut-and-price for capacitated vehicle routing / 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: A branch-and-price algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: There is no asymptotic PTAS for two-dimensional vector packing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2021.10.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:51, 19 December 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
scientific article

    Statements

    An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2022
    0 references
    packing
    0 references
    two-dimensional vector packing problem
    0 references
    volumetric weight
    0 references
    general costs
    0 references
    branch-and-price-and-cut
    0 references
    0 references

    Identifiers