Friendly bin packing instances without integer round-up property (Q2340275): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
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.1007/s10107-014-0791-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1963954876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dual-feasible and superadditive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of non-IRUP instances of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional packing by bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analyses, linear programming and the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin Packing via Discrepancy of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem / 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

Revision as of 22:45, 9 July 2024

scientific article
Language Label Description Also known as
English
Friendly bin packing instances without integer round-up property
scientific article

    Statements

    Friendly bin packing instances without integer round-up property (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2015
    0 references
    bin packing problem
    0 references
    integer round-up property
    0 references
    Petersen graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references