Journal ArticleDOI
Models and algorithms for network reduction
Gang Li,Anantaram Balakrishnan +1 more
TLDR
Two variants of the Network Reduction (NR) problem are considered—a Min-Size NR problem that minimizes the number of arcs in the reduced network while ensuring that the shortest path lengths in this network are close to the original lengths, and a Min-Length NR problem which minimizes a weighted sum of shortest pathlength over all the specified node pairs.About:
This article is published in European Journal of Operational Research.The article was published on 2016-02-01. It has received 6 citations till now. The article focuses on the topics: K shortest path routing & Average path length.read more
Citations
More filters
Journal ArticleDOI
Coordinating assignment and routing decisions in transit vehicle schedules: A variable-splitting Lagrangian decomposition approach for solution symmetry breaking
TL;DR: A variable-splitting approach is adopted to introduce task-specific and vehicle-distinguishable Lagrangian multipliers and then a sequential assignment process is proposed in order to enhance the solution quality for the augmented models with tight formulations.
Journal ArticleDOI
Multicast routing based on data envelopment analysis with multiple Quality of Service parameters
TL;DR: An integer linear programming model based on the relative efficiency of arcs is proposed to obtain multicast trees for transmitting data from a source to each destination based on data envelopment analysis techniques.
Journal ArticleDOI
Performance Comparison of Mode Choice Optimization Algorithm with Simulated Discrete Choice Modeling
TL;DR: Two extended algorithms, called DFP-G SM and BFGS-GSM, are proposed for the first time to overcome the weakness of the Quasi-Newton method and show a stable estimation performance.
Journal ArticleDOI
Improved algorithms for joint optimization of facility locations and network connections
Xiaofan Lai,Zhou Xu +1 more
TL;DR: This study studies a k-median Steiner forest problem that jointly optimizes the opening of at most k facility locations and their connections to the client locations, so that each client is connected by a path to an open facility, with the total connection cost minimized.
Journal ArticleDOI
New Valid Inequalities for the Optimal Communication Spanning Tree Problem
TL;DR: The problem of designing a spanning tree on an underlying graph to minimize the flow costs of a given set of traffic demands is considered.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Book
Integer and Combinatorial Optimization
TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.