Bin packing problem with conflicts and item fragmentation (Q2026980): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Branch-and-cut algorithms for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for determining the number of warehouses for storing non-compatible products / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bin packing problem with item fragmentation: a worst-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of lower bound procedures for the bin packing problem / 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: Lower bounds for a bin packing problem with linear usage cost / 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: New formulations for variable cost and size bin packing problems with item fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical programming algorithms for bin packing problems with item fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exactly solving packing problems with fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the asymptotic worst-case of bin packing lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bin packing fast lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Loading Problem / 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: Improved results for a memory allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for packing splittable items with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for one-dimensional bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and lower bounds for the bin packing problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing problems in one dimension: Heuristic solutions and confidence intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for bin packing with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation based Primal Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for bin packing problems with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The min-conflict packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing with fragmentable items: presentation and approximations / 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: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of fragmentable object bin packing and an application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the 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: Q2786902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid genetic algorithms for bin-packing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for packing with item fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290987 / 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: Branching in branch-and-price: A generic scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds of the First Fit algorithm for the bin-packing problem / rank
 
Normal rank

Revision as of 20:25, 25 July 2024

scientific article
Language Label Description Also known as
English
Bin packing problem with conflicts and item fragmentation
scientific article

    Statements

    Bin packing problem with conflicts and item fragmentation (English)
    0 references
    0 references
    21 May 2021
    0 references
    bin packing problem with conflicts
    0 references
    item fragmentation
    0 references
    heuristic
    0 references
    lower bound
    0 references
    oversized items
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers