Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3104252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs with Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some difficult linear programs coming from set partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal solutions to large-scale facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Integer Solutions to Industrial Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bid evaluation in procurement auctions with piecewise linear supply curves / 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: Implementing interior point linear programming methods in the Optimization Subroutine Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem / 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: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cropped cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Algorithms for Zero-One and Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848284 / 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 note on ``Branch-and-price algorithms for the one-dimensional cutting stock problems'' / 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: Computational study of a column generation algorithm for bin packing and cutting stock problems / rank
 
Normal rank

Latest revision as of 11:45, 24 June 2024

scientific article
Language Label Description Also known as
English
Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
scientific article

    Statements

    Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    open-source software
    0 references
    cutting stock problem
    0 references
    branch-and-price methods
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references