On two new formulations for the fixed charge network design problem with shortest path constraints (Q2003438): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hazmat Transport Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing a road network for hazardous materials shipments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hazmat transport network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane approach for bilevel hazardous material transport network design / rank
 
Normal rank

Revision as of 19:24, 19 July 2024

scientific article
Language Label Description Also known as
English
On two new formulations for the fixed charge network design problem with shortest path constraints
scientific article

    Statements

    On two new formulations for the fixed charge network design problem with shortest path constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 July 2019
    0 references
    network design
    0 references
    bi-level programming
    0 references
    cutting plane
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references