Algorithms for the one-dimensional two-stage cutting stock problem (Q724047): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129915245, #quickstatements; #temporary_batch_1726323884171
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ịbrahim Muter / rank
Normal rank
 
Property / author
 
Property / author: Ịbrahim Muter / 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.2018.04.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800285872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LP-based heuristic for a time-constrained routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / 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: Q4079613 / 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: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase roll cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 reformulations of the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / 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: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one dimensional Compartmentalised Knapsack problem: a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for nested knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalized knapsack problem: mathematical models and solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained compartmentalised knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``A LP-based heuristic for a time-constrained routing problem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows / 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: An LP-based approach to a two-stage cutting stock 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: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack problem with a minimum filling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling multistage cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row and column generation technique for a multistage cutting stock problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129915245 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:26, 14 September 2024

scientific article
Language Label Description Also known as
English
Algorithms for the one-dimensional two-stage cutting stock problem
scientific article

    Statements

    Algorithms for the one-dimensional two-stage cutting stock problem (English)
    0 references
    0 references
    0 references
    25 July 2018
    0 references
    0 references
    cutting
    0 references
    two-stage cutting stock problem
    0 references
    column-and-row generation
    0 references
    problems with column-dependent-rows
    0 references
    0 references
    0 references
    0 references
    0 references