Variable neighbourhood search for the variable sized bin packing problem (Q1762087): 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.1016/j.cor.2011.07.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083558280 / 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: Variable Sized Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing / 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: Algorithms for the variable sized bin packing problem / 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: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths / 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: Relaxations and exact solution of the variable sized bin packing problem / 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: Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank

Latest revision as of 22:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Variable neighbourhood search for the variable sized bin packing problem
scientific article

    Statements

    Variable neighbourhood search for the variable sized bin packing problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    variable sized bin packing
    0 references
    variable neighbourhood search
    0 references
    hybrid algorithms
    0 references
    0 references