On cut-based inequalities for capacitated network design polyhedra (Q3082603): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20395 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013920518 / rank
 
Normal rank

Revision as of 20:55, 19 March 2024

scientific article
Language Label Description Also known as
English
On cut-based inequalities for capacitated network design polyhedra
scientific article

    Statements

    On cut-based inequalities for capacitated network design polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    capacitated network design
    0 references
    cutset polyhedra
    0 references
    flow-cutset inequalities
    0 references
    cut residual capacity inequalities
    0 references
    integer programming
    0 references
    mixed-integer rounding SNDlib
    0 references
    0 references
    0 references
    0 references