Branching in branch-and-price: A generic scheme (Q652288): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GENCOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ABACUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / 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.1007/s10107-009-0334-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999895824 / 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: Comparison of bundle and classical column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carathéodory bounds for integer cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Q4735940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From High-Level Model to Branch-and-Price Solution in G12 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to ABACUS -- a branch-and-cut system / 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: 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
Property / cites work
 
Property / cites work: On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Dantzig's bound to the bounded multiple-class binary knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact formulations for integer programs solved by column generation / rank
 
Normal rank

Latest revision as of 17:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Branching in branch-and-price: A generic scheme
scientific article

    Statements

    Branching in branch-and-price: A generic scheme (English)
    0 references
    14 December 2011
    0 references
    integer programming
    0 references
    Dantzig--Wolfe reformulation
    0 references
    branch-and-price
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers