Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with time windows by column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for routing with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Optimal solutions for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock problems and solution procedures / 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: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cutting stock problem and integer rounding / 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal solutions to one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution / rank
 
Normal rank

Latest revision as of 15:58, 22 May 2024

scientific article
Language Label Description Also known as
English
Solving binary cutting stock problems by column generation and branch- and-bound
scientific article

    Statements

    Solving binary cutting stock problems by column generation and branch- and-bound (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    binary cutting stock problem
    0 references
    column generation
    0 references
    branch-and-bound
    0 references