Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650579 / rank
 
Normal rank
Property / zbMATH Keywords
 
continuous network design problem (CNDP)
Property / zbMATH Keywords: continuous network design problem (CNDP) / rank
 
Normal rank
Property / zbMATH Keywords
 
bilevel programming problem
Property / zbMATH Keywords: bilevel programming problem / rank
 
Normal rank
Property / zbMATH Keywords
 
relaxation algorithm
Property / zbMATH Keywords: relaxation algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
tradable credit scheme
Property / zbMATH Keywords: tradable credit scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
equity
Property / zbMATH Keywords: equity / rank
 
Normal rank

Revision as of 05:18, 28 June 2023

scientific article
Language Label Description Also known as
English
Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
scientific article

    Statements

    Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    continuous network design problem (CNDP)
    0 references
    bilevel programming problem
    0 references
    relaxation algorithm
    0 references
    tradable credit scheme
    0 references
    equity
    0 references

    Identifiers