Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650759 / rank
 
Normal rank
Property / zbMATH Keywords
 
nonbifurcated hop-constrained multicommodity network design problem
Property / zbMATH Keywords: nonbifurcated hop-constrained multicommodity network design problem / rank
 
Normal rank
Property / zbMATH Keywords
 
formulations
Property / zbMATH Keywords: formulations / rank
 
Normal rank
Property / zbMATH Keywords
 
relaxations
Property / zbMATH Keywords: relaxations / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrangean relaxation
Property / zbMATH Keywords: Lagrangean relaxation / 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.cor.2014.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002184897 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 19:04, 19 March 2024

scientific article
Language Label Description Also known as
English
Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
scientific article

    Statements

    Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    nonbifurcated hop-constrained multicommodity network design problem
    0 references
    formulations
    0 references
    relaxations
    0 references
    Lagrangean relaxation
    0 references
    0 references