R
Richard T. Wong
Researcher at Purdue University
Publications - 26
Citations - 4078
Richard T. Wong is an academic researcher from Purdue University. The author has contributed to research in topics: Vehicle routing problem & Network planning and design. The author has an hindex of 15, co-authored 26 publications receiving 3862 citations. Previous affiliations of Richard T. Wong include Bell Labs & Alcatel-Lucent.
Papers
More filters
Journal ArticleDOI
Network Design and Transportation Planning: Models and Algorithms
TL;DR: It is shown that many of the most celebrated combinatorial problems that arise in transportation planning are specializations and variations of a generic design model, Consequently, the network design concepts described in this paper have great potential application in a wide range of problem settings.
Journal ArticleDOI
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
TL;DR: A new technique for accelerating the convergence of the algorithm and theory for distinguishing “good” model formulations of a problem that has distinct but equivalent mixed integer programming representations is introduced.
Journal ArticleDOI
Capacitated arc routing problems
Bruce L. Golden,Richard T. Wong +1 more
TL;DR: The intent in this paper is to define a capacitated arc routing problem, to provide mathematical programming formulations, to perform a computational complexity analysis, and to present an approximate solution strategy for this class of problems.
Journal ArticleDOI
A dual ascent approach for steiner tree problems on a directed graph
TL;DR: It is shown that the ascent procedure can be viewed as a generalization of both the Chu-Liu-Edmonds directed spanning tree algorithm and the Bilde-Krarup-Erlenkotter ascent algorithm for the plant location problem.
Journal ArticleDOI
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
TL;DR: This work develops a family of dual-ascent algorithms that generalizes known ascent procedures for solving shortest path, plant location, Steiner network and directed spanning tree problems and generates solutions that are guaranteed to be within 1 to 4% of optimality.