Global optimum search in the network design problem

DOI10.1134/S0965542524701239MaRDI QIDQ6654907zbMATH OpenFDO

Authors Aleksandr Yu. Krylatov

Publication date 20 December 2024

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542524701239

zbMATH Keywords

network design problemequilibrium flow assignment

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Systems theory; control (93-XX)

Recommendations

• Global optimization of nonlinear network design
• scientific article; zbMATH DE number 3914111
• scientific article; zbMATH DE number 4027150
• scientific article; zbMATH DE number 3882168
• Global search algorithms for minimum concave-cost network flow problems

Cites work

• A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
• Bilevel programming in traffic planning: Models, methods and challenge
• Efficient implementation of heuristics for the continuous network design problem
• Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
• Equilibrium points of nonatomic games
• Internalization of social cost in congestion games
• Network flow assignment as a fixed point problem
• New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications
• Sensitivity Analysis for Equilibrium Network Flow
• Sensitivity analysis for variational inequalities
• Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review

This page was built for publication: Global optimum search in the network design problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654907)