Integrating link-based discrete credit charging scheme into discrete network design problem
type: Item
instance of: scholarly article
title: Integrating link-based discrete credit charging scheme into discrete network design problem
zbMATH Open document ID: 1403.90180
author: Meng Xu
author: Guangmin Wang
author: Ziyou Gao
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6968051
zbMATH Keywords: transportation
zbMATH Keywords: discrete network design problem (DNDP)
zbMATH Keywords: bilevel programming problem
zbMATH Keywords: tradable credit scheme (TCS)
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.05.069
OpenAlex ID: W2807398977
cites work: Practical Optimization
cites work: An overview of bilevel optimization
cites work: Foundations of bilevel programming
cites work: A review of urban transportation network design problems
cites work: A branch and bound algorithm for bi-level discrete network design problem
cites work: A dynamic discrete network design problem for maintenance planning in traffic networks
cites work: Q4692508
cites work: Global optimization of mixed-integer bilevel programming problems
cites work: An alternative approach for solving the environmentally-oriented discrete network design problem
cites work: Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem
cites work: Nonlinear integer bilevel programming
cites work: Parametric integer programming algorithm for bilevel mixed integer programs
cites work: A single-level reformulation of mixed integer bilevel programming problems
cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem
cites work: Global solution of nonlinear mixed-integer bilevel programs
cites work: A framework for and empirical study of algorithms for traffic assignment
cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique
cites work: Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem
cites work: Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints
DOI: 10.1016/J.EJOR.2018.05.069
description: scientific article; zbMATH DE number 6968051