Richard T. Wong

Orcid: 0000-0001-5543-9975

According to our database1, Richard T. Wong authored at least 23 papers between 1978 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Telecommunications network design: Technology impacts and future directions.
Networks, 2021

2009
Arc-Routing Models for Small-Package Local Routing.
Transp. Sci., 2009

2005
Graceful reassignment of excessively long communications paths in networks.
Eur. J. Oper. Res., 2005

2004
Survivable telecommunications network design under different types of failures.
IEEE Trans. Syst. Man Cybern. Part A, 2004

2002
Incorporating QoS into IP Enterprise Network Design.
Telecommun. Syst., 2002

1998
Topological network design for SONET ring architecture.
IEEE Trans. Syst. Man Cybern. Part A, 1998

1995
A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning.
Oper. Res., 1995

1992
Scheduling examinations to reduce second-order conflicts.
Comput. Oper. Res., 1992

1991
Aggregation and Disaggregation Techniques and Methodology in Optimization.
Oper. Res., 1991

Models for planning capacity expansion in local access telecommunication networks.
Ann. Oper. Res., 1991

1990
A network model for the rotating workforce scheduling problem.
Networks, 1990

1989
An Integrated Inventory Allocation and Vehicle Routing Problem.
Transp. Sci., 1989

A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.
Oper. Res., 1989

1987
The <i>P</i>-Centroid Problem on an Inclined Plane.
Oper. Res., 1987

1986
Comment on "expert systems, microcomputers, and operations research".
Comput. Oper. Res., 1986

1985
Linear programming, by Vasek Chvatal, W. H. Freeman and Company, New York, 1983, 478 pp., Price: $24.95.
Networks, 1985

Probabilistic analysis of a network design problem heuristic.
Networks, 1985

1984
Network Design and Transportation Planning: Models and Algorithms.
Transp. Sci., 1984

A dual ascent approach for steiner tree problems on a directed graph.
Math. Program., 1984

1981
Capacitated arc routing problems.
Networks, 1981

Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria.
Oper. Res., 1981

1980
Worst-Case Analysis of Network Design Problem Heuristics.
SIAM J. Algebraic Discret. Methods, 1980

1978
Accelerating Benders decomposition for network design.
PhD thesis, 1978


  Loading...