An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
From MaRDI portal
Publication:1994496
Recommendations
- A general MPCC model and its solution algorithm for continuous network design problem
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach
- A cutting-plane neighborhood structure for fixed-charge capacitated multicommodity network design problem
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- An Alternative LP Formulation of the Admission Control Problem in Multiclass Networks
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- A branch-and-cut algorithm for capacitated network design problems
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 978735 (Why is no real title available?)
- scientific article; zbMATH DE number 1059230 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- scientific article; zbMATH DE number 956791 (Why is no real title available?)
- A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- A continuous bi-level model for the expansion of highway networks
- A general MPCC model and its solution algorithm for continuous network design problem
- A globally convergent algorithm for transportation continuous network design problem
- A meta-heuristic approach for solving the urban network design problem
- A review of urban transportation network design problems
- A subgradient optimization model for continuous road network design problem
- An MPEC approach to second-best toll pricing.
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
- Bilevel programming in traffic planning: Models, methods and challenge
- Cost versus time equilibrium over a network
- Efficient implementation of heuristics for the continuous network design problem
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- Hybrid meta-heuristic algorithms for solving network design problem
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Optimization and nonsmooth analysis
- Problems of Hierarchical Optimization in Finite Dimensions
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
Cited in
(7)- A globally convergent algorithm for transportation continuous network design problem
- Multi-class time reliability-based congestion pricing model based on a degradable transportation network
- An anisotropic continuum model for traffic assignment in mixed transportation networks
- A DC programming approach to the continuous equilibrium network design problem
- A perturbation-based approach for continuous network design problem with emissions
- A general MPCC model and its solution algorithm for continuous network design problem
- A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand
This page was built for publication: An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994496)
