An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
DOI10.1016/J.APM.2013.10.003zbMATH Open1427.90069OpenAlexW1974536311MaRDI QIDQ1994496FDOQ1994496
Authors: Yanyan Li
Publication date: 1 November 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.10.003
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
continuous network design problem (CNDP)multi-user classescutting constraint algorithm (CCA)mathematical programming with equilibrium constraint (MPEC)
Cites Work
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Bilevel programming in traffic planning: Models, methods and challenge
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- A meta-heuristic approach for solving the urban network design problem
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- An MPEC approach to second-best toll pricing.
- Hybrid meta-heuristic algorithms for solving network design problem
- Efficient implementation of heuristics for the continuous network design problem
- A review of urban transportation network design problems
- A general MPCC model and its solution algorithm for continuous network design problem
- A subgradient optimization model for continuous road network design problem
- Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
- Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
- A continuous bi-level model for the expansion of highway networks
- Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
- Title not available (Why is that?)
- A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
- The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
- A globally convergent algorithm for transportation continuous network design problem
- Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
- Cost versus time equilibrium over a network
- Title not available (Why is that?)
- Problems of Hierarchical Optimization in Finite Dimensions
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
Uses Software
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)