A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PERL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952774731 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.03217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / 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: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders, metric and cutset inequalities for multicommodity capacitated network design / 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: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Internet Protocol network design and routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank
 
Normal rank

Latest revision as of 00:03, 13 July 2024

scientific article
Language Label Description Also known as
English
A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow
scientific article

    Statements

    A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    network design
    0 references
    bilevel problem
    0 references
    heuristics
    0 references
    local branching
    0 references
    0 references
    0 references

    Identifiers

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