Bilevel programming in traffic planning: Models, methods and challenge
From MaRDI portal
Publication:1913607
DOI10.1007/BF01099649zbMath0844.90050MaRDI QIDQ1913607
Publication date: 22 May 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimization; bilevel programming; transportation planning; network problems; traffic planning
90C90: Applications of mathematical programming
93A13: Hierarchical systems
90B90: Case-oriented studies in operations research
Related Items
On the robustness of global optima and stationary solutions to stochastic mathematical programs with equilibrium constraints. II: Applications, Solving bilevel programming problems with multicriteria optimization techniques, Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation, An overview of bilevel optimization, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, A method for solving bilevel linear programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear bilevel programming algorithm based on bicriteria programming
- Sensitivity analysis for variational inequalities
- Introduction to sensitivity and stability analysis in nonlinear programming
- Construction of a real-world bilevel linear programming model of the highway network design problem
- Some properties of the bilevel programming problem
- Finiteness in restricted simplicial decomposition
- Convex two-level optimization
- A note on a linear bilevel programming algorithm based on bicriteria programming
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Dynamic noncooperative game theory
- Implicitly defined optimization problems
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- Efficient implementation of heuristics for the continuous network design problem
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- A global optimization approach for the linear two-level program
- An efficient dual approach to the urban road network design problem
- A quasiconcave minimization method for solving linear two-level programs
- Descent approaches for quadratic bilevel programming
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
- Bilevel and multilevel programming: A bibliography review
- On the convergence of descent methods for monotone variational inequalities
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Computational Difficulties of Bilevel Linear Programming
- A game-theoretic approach to network equilibrium
- The polynomial hierarchy and a simple model for competitive analysis
- Network design problem with congestion effects: A case of bilevel programming
- Improved Efficiency of the Frank-Wolfe Algorithm for Convex Network Programs
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- Computing equilibria on large multicommodity networks: An application of truncated quadratic programming algorithms
- Sensitivity Analysis for Equilibrium Network Flow
- A partial linearization method for the traffic assignment problem
- The general multimodal network equilibrium problem with elastic demand
- Equilibria on a Congested Transportation Network
- Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Sensitivity analysis for nonlinear programming using penalty methods
- Traffic assignment problem for a general network
