Solution Algorithm for a New Bi-Level Discrete Network Design Problem
A new discrete network design problem (DNDP) was pro-posed in this paper, where the variables can be a series of integers rather than just 0-1. The new DNDP can determine both capacity improvement grades of reconstruction roads and locations and capacity grades of newly added roads, and thus complie...
Main Authors: | Qun Chen, Haibo Chen |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zagreb, Faculty of Transport and Traffic Sciences
2013-12-01
|
Series: | Promet (Zagreb) |
Subjects: | |
Online Access: | http://www.fpz.unizg.hr/traffic/index.php/PROMTT/article/view/1424 |
Similar Items
-
Continuous and integer generalized flow problems
by: Langley, Robert Warren
Published: (2008) -
Fixed-charge transportation problem: a group theoretic approach
by: Kennington, Jeffery Lynn
Published: (2008) -
Solving Weber Problem on Plane with Minimax Criterion and Forbidden Gaps
by: G.G. Zabudsky, et al.
Published: (2014-09-01) -
FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.
by: SINGHAL, JAYA ASTHANA.
Published: (1982) -
Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
by: Elias Munapo
Published: (2020-04-01)