A branch and bound algorithm for bi-level discrete network design problem (Q264253): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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.1007/s11067-012-9173-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000900837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Origin-Based Algorithm for the Traffic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization model for a dynamic network design problem under demand uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using hybrid metaheuristics for the one-way and two-way network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary metaheuristics for concurrent multi-objective design of urban road and public transit networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid meta-heuristic algorithms for solving network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming model and solution method for mixed transportation network design problem / rank
 
Normal rank

Latest revision as of 16:24, 11 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for bi-level discrete network design problem
scientific article

    Statements

    A branch and bound algorithm for bi-level discrete network design problem (English)
    0 references
    0 references
    0 references
    31 March 2016
    0 references
    network design problem
    0 references
    bi-level programming
    0 references
    branch and bound
    0 references
    outer approximation
    0 references

    Identifiers