Bruce L. Golden
Orcid: 0000-0002-5270-6094Affiliations:
- University of Maryland, USA
According to our database1,
Bruce L. Golden
authored at least 184 papers
between 1975 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Interval pairwise comparisons in the presence of infeasibilities: Numerical experiments.
Comput. Oper. Res., 2025
2024
Estimating optimal objective values for the TSP, VRP, and other combinatorial problems using randomization.
Int. Trans. Oper. Res., September, 2024
AASA: A Priori Adaptive Splitting Algorithm for the Split Delivery Vehicle Routing Problem.
Algorithms, September, 2024
Algorithms, June, 2024
Optim. Lett., April, 2024
Comput. Oper. Res., 2024
2023
Eur. J. Oper. Res., November, 2023
Using regression models to understand the impact of route-length variability in practical vehicle routing.
Optim. Lett., 2023
INFORMS J. Comput., 2023
PASA: A Priori Adaptive Splitting Algorithm for the Split Delivery Vehicle Routing Problem.
CoRR, 2023
Algorithms, 2023
2022
The multivisit drone routing problem with edge launches: An iterative approach with discrete and continuous improvements.
Networks, 2022
Data-driven optimization and statistical modeling to improve meter reading for utility companies.
Comput. Oper. Res., 2022
Comput. Oper. Res., 2022
Comput. Oper. Res., 2022
2021
INFORMS J. Comput., 2021
Algorithms, 2021
2020
Dataset, August, 2020
An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput., 2020
2019
Preface: Special Issue on Network Optimization in Transportation, Logistics, and Industry (Part 2).
Networks, 2019
INFORMS J. Comput., 2019
A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties.
Eur. J. Oper. Res., 2019
Discret. Appl. Math., 2019
A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem.
Comput. Oper. Res., 2019
2018
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey.
Networks, 2018
Applying queueing theory to the study of emergency department operations: a survey and a discussion of comparable simulation studies.
Int. Trans. Oper. Res., 2018
INFORMS J. Comput., 2018
2017
Optim. Lett., 2017
Networks, 2017
Networks, 2017
Networks, 2017
Int. Trans. Oper. Res., 2017
Eur. J. Oper. Res., 2017
A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows.
Comput. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement.
Comput. Oper. Res., 2016
2015
The min-max multi-depot vehicle routing problem: heuristics and computational results.
J. Oper. Res. Soc., 2015
Inf. Syst. E Bus. Manag., 2015
2014
A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts.
Optim. Lett., 2014
Vehicle routing problems in which consistency considerations are important: A survey.
Networks, 2014
Proceedings of the 2014 Winter Simulation Conference, 2014
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014
Proceedings of the 5th ACM Conference on Bioinformatics, 2014
Proceedings of the Vehicle Routing, 2014
2013
A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts.
Optim. Lett., 2013
Int. J. Metaheuristics, 2013
Comput. Oper. Res., 2013
Optimizing throughput of a multi-room proton therapy treatment center via simulation.
Proceedings of the Winter Simulations Conference: Simulation Making Decisions in a Complex World, 2013
2012
Introduction to the Special Issue on Applications of Healthcare Operations Management.
Manuf. Serv. Oper. Manag., 2012
J. Oper. Res. Soc., 2012
2011
The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results.
Comput. Ind. Eng., 2011
An application of factorial design to compare the relative effectiveness of hospital infection control measures.
Proceedings of the Winter Simulation Conference 2011, 2011
2010
Math. Program. Comput., 2010
INFORMS J. Comput., 2010
J. Heuristics, 2010
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.
Comput. Oper. Res., 2010
Proceedings of the 2010 Winter Simulation Conference, 2010
2009
Introduction: Applications of Management Science and Operations Research Models and Methods to Problems in Health Care.
Interfaces, 2009
2008
J. Oper. Res. Soc., 2008
Comput. Oper. Res., 2008
Proceedings of the 2008 Spring Simulation Multiconference, 2008
2007
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results.
Networks, 2007
Ranking US Army Generals of the 20th Century: A Group Decision-Making Application of the Analytic Hierarchy Process.
Interfaces, 2007
Call for Papers - <i>Interfaces</i> Special Issue: Applications of Management Science and Operations Research Models and Methods to Problems in Health Care.
Interfaces, 2007
<i>Interfaces</i> Special Issue: Applications of Management Science and Operations Research Models and Methods to Problems in Health Care.
Interfaces, 2007
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results.
Comput. Oper. Res., 2007
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem.
Comput. Oper. Res., 2007
2006
IEEE Trans. Evol. Comput., 2006
Comput. Oper. Res., 2006
2005
IEEE Trans. Evol. Comput., 2005
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem.
Oper. Res. Lett., 2005
INFORMS J. Comput., 2005
Comput. Oper. Res., 2005
Comput. Oper. Res., 2005
2004
Proceedings of the Genetic and Evolutionary Computation, 2004
2003
Oper. Res., 2003
INFORMS J. Comput., 2003
Comput. Oper. Res., 2003
2002
Solving the traveling salesman problem with annealing-based heuristics: a computational study.
IEEE Trans. Syst. Man Cybern. Part A, 2002
Routing Vehicles in the Real World: Applications in the Solid Waste, Beverage, Food, Dairy, and Newspaper Industries.
Proceedings of the Vehicle Routing Problem., 2002
2001
J. Heuristics, 2001
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001
2000
Eur. J. Oper. Res., 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
Comput. Oper. Res., 1999
1998
See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem.
IEEE Trans. Syst. Man Cybern. Part A, 1998
1997
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Comput. Oper. Res., 1997
1995
J. Heuristics, 1995
J. Heuristics, 1995
Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks.
Comput. Oper. Res., 1995
Ann. Oper. Res., 1995
1994
Comput. Oper. Res., 1994
Ann. Oper. Res., 1994
Chapter 9 Managing fish, forests, wildlife, and water: Applications of management science and operations research to natural resource decision problems.
Proceedings of the Operations research and the public sector, 1994
1993
Comput. Oper. Res., 1993
Ann. Oper. Res., 1993
1992
Comput. Oper. Res., 1992
1991
Using simulation to study the impact of work rules on productivity at marine container terminals.
Comput. Oper. Res., 1991
1990
INFORMS J. Comput., 1990
1989
Comput. Oper. Res., 1989
1987
Oper. Res., 1987
1986
Oper. Res., 1986
Comput. Oper. Res., 1986
Comput. Oper. Res., 1986
1984
1983
Comput. Oper. Res., 1983
Proceedings of the 15th conference on Winter simulation, 1983
1982
Comput. Oper. Res., 1982
Proceedings of the Adequate Modeling of Systems, 1982
1981
Comput. Oper. Res., 1981
1980
Location on networks: Theory and algorithms, Gabriel Handler and Pitu Mirchandani, MIT Press, Cambridge, 1979, 233 pp. Price: $20.00.
Networks, 1980
1979
Optimization Algorithms for Networks and Graphs. By Edward Minieka, Marcel Dekker, Inc. New York, New York, 1978, $19.75, 356 Pages.
Networks, 1979
Topics in Combinatorial Optimization. Edited By S. Rinaldi, Springer-Verlag New York, New York, 1975, $15.20, 186 Pages.
Networks, 1979
1978
Graphs as mathematical models by Gary Chartrand, Prindle, Weber & Schmidt, Inc. Boston, Massachusetts 1977, $15.50, 294 pages.
Networks, 1978
Closed-Form Statistical Estimates Of Optimal Solution Values To Combinatorial Problems.
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978
1977
1976
1975
Networks, 1975