Bruce L. Golden

According to our database1, Bruce L. Golden authored at least 157 papers between 1975 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





The Mothership and Drone Routing Problem.
INFORMS J. Comput., 2020

Multi-visit drone routing problem.
Comput. Oper. Res., 2020

Preface: Special Issue on Network Optimization in Transportation, Logistics, and Industry (Part 2).
Networks, 2019

Editorial: 2018 Glover-Klingman Prize Winners.
Networks, 2019

OAR Lib: an open source arc routing library.
Math. Program. Comput., 2019

A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone.
INFORMS J. Comput., 2019

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties.
Eur. J. Oper. Res., 2019

The Bin Packing Problem with Item Fragmentation: A worst-case analysis.
Discret. Appl. Math., 2019

A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem.
Comput. Oper. Res., 2019

Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey.
Networks, 2018

Editorial: 2017 Glover-Klingman Prize Winners.
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

An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances.
INFORMS J. Comput., 2018

The vehicle routing problem with drones: several worst-case results.
Optim. Lett., 2017

The vehicle routing problem with drones: Extended models and connections.
Networks, 2017

Partitioning a street network into compact, balanced, and visually appealing routes.
Networks, 2017

Editorial: 2016 Glover-Klingman Prize Winners.
Networks, 2017

Aesthetic considerations for the min-max K-Windy Rural Postman Problem.
Networks, 2017

A novel approach to solve the split delivery vehicle routing problem.
Int. Trans. Oper. Res., 2017

The windy rural postman problem with a time-dependent zigzag option.
Eur. J. Oper. Res., 2017

A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows.
Comput. Oper. Res., 2017

Carousel greedy: A generalized greedy algorithm with applications in optimization.
Comput. Oper. Res., 2017

Networks, 2016

Editorial: 2015 Glover-Klingman Prize Winners.
Networks, 2016

The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement.
Comput. Oper. Res., 2016

The Generalized Consistent Vehicle Routing Problem.
Transp. Sci., 2015

Editorial: 2014 Glover-Klingman Prize winners.
Networks, 2015

Editorial: 2013 Glover-Klingman Prize winners.
Networks, 2015

The min-max multi-depot vehicle routing problem: heuristics and computational results.
J. Oper. Res. Soc., 2015

Predicting prostate cancer risk using magnetic resonance imaging data.
Inf. Syst. E Bus. Manag., 2015

Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.
Eur. J. Oper. Res., 2015

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

The downhill plow problem with multiple plows.
J. Oper. Res. Soc., 2014

Multi-period street scheduling and sweeping.
Int. J. Metaheuristics, 2014

Early detection of bioterrorism: monitoring disease using an agent-based model.
Proceedings of the 2014 Winter Simulation Conference, 2014

A heterogeneous compute solution for optimized genomic selection analysis.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

Data mining to aid beam angle selection for intensity-modulated radiation therapy.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

Vehicle Routing Applications in Disaster Relief.
Proceedings of the Vehicle Routing, 2014

A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts.
Optim. Lett., 2013

The hierarchical traveling salesman problem.
Optim. Lett., 2013

Editorial: 2011 Glover-Klingman Prize Winners.
Networks, 2013

Comparison of heuristics for the colourful travelling salesman problem.
Int. J. Metaheuristics, 2013

Plowing with precedence: A variant of the windy postman problem.
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

Editorial: 2010 Glover-Klingman prize winners.
Networks, 2012

Introduction to the Special Issue on Applications of Healthcare Operations Management.
Manufacturing & Service Operations Management, 2012

An evolutionary approach for tuning parametric Esau and Williams heuristics.
J. Oper. Res. Soc., 2012

The Generalized Covering Salesman Problem.
INFORMS J. Comput., 2012

Editorial: 2009 Glover-Klingman Prize winners.
Networks, 2011

A Parallel Algorithm for the Vehicle Routing Problem.
INFORMS J. Comput., 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

Editorial: 2008 Glover-Klingman prize winners.
Networks, 2010

A library of local search heuristics for the vehicle routing problem.
Math. Program. Comput., 2010

MRSA Transmission Reduction Using Agent-Based Modeling and Simulation.
INFORMS J. Comput., 2010

The effective application of a new approach to the generalized orienteering problem.
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

A dynamic patient network model of hospital-acquired infections.
Proceedings of the 2010 Winter Simulation Conference, 2010

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

The balanced billing cycle vehicle routing problem.
Networks, 2009

The Consistent Vehicle Routing Problem.
Manufacturing & Service Operations Management, 2009

Introduction: Applications of Management Science and Operations Research Models and Methods to Problems in Health Care.
Interfaces, 2009

Editorial: 2007 Glover-Klingman Prize winners.
Networks, 2008

Editorial: 2006 Glover-Klingman Prize winners.
Networks, 2008

Tuning a parametric Clarke-Wright heuristic via a genetic algorithm.
J. Oper. Res. Soc., 2008

The prize-collecting generalized minimum spanning tree problem.
J. Heuristics, 2008

Solving the one-dimensional bin packing problem with a weight annealing heuristic.
Comput. Oper. Res., 2008

Maximizing cardiac surgery throughput at a major hospital.
Proceedings of the 2008 Spring Simulation Multiconference, 2008

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

Improved Heuristics for the Minimum Label Spanning Tree Problem.
IEEE Trans. Evol. Comput., 2006

Editorial: 2005 Glover-Klingman prize winners.
Networks, 2006

The Multilevel Capacitated Minimum Spanning Tree Problem.
INFORMS J. Comput., 2006

Diversification for better classification trees.
Comput. Oper. Res., 2006

A divide-and-conquer local search heuristic for data visualization.
Comput. Oper. Res., 2006

A one-parameter genetic algorithm for the minimum labeling spanning tree problem.
IEEE Trans. Evol. Comput., 2005

Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem.
Oper. Res. Lett., 2005

Heuristic Search for the Generalized Minimum Spanning Tree Problem.
INFORMS J. Comput., 2005

Very large-scale vehicle routing: new test problems, algorithms, and results.
Comput. Oper. Res., 2005

Linear programming models for estimating weights in the analytic hierarchy process.
Comput. Oper. Res., 2005

2003 Glover-Klingman prize winners.
Networks, 2004

Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems.
Proceedings of the Genetic and Evolutionary Computation, 2004

Editorial: Glover-Klingman prize.
Networks, 2003

Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees.
Oper. Res., 2003

A Genetic Algorithm-Based Approach for Building Accurate Decision Trees.
INFORMS J. Comput., 2003

Celebrating 25 years of AHP-based decision making.
Comput. Oper. Res., 2003

Visualizing group decisions in the analytic hierarchy process.
Comput. Oper. Res., 2003

Solving the traveling salesman problem with annealing-based heuristics: a computational study.
IEEE Trans. Syst. Man Cybern. Part A, 2002

A visualization model based on adjacency data.
Decis. Support Syst., 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

Using Experimental Design to Find Effective Parameter Settings for Heuristics.
J. Heuristics, 2001

Clustering Rules Using Empirical Similarity of Support Sets.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

A computational study of smoothing heuristics for the traveling salesman problem.
Eur. J. Oper. Res., 2000

Networks And Flows.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

Predicting the success of nations at the Summer Olympics using neural networks.
Comput. Oper. Res., 1999

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

Appreciation to Referees.
INFORMS J. Comput., 1998

Neural network models for initial public offerings.
Neurocomputing, 1998

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective.
Comput. Oper. Res., 1997

An improved heuristic for the period vehicle routing problem.
Networks, 1995

A hierarchical strategy for solving traveling salesman problems using elastic nets.
J. Heuristics, 1995

Designing and reporting on computational experiments with heuristic methods.
J. Heuristics, 1995

Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks.
Comput. Oper. Res., 1995

A new heuristic for the period traveling salesman problem.
Comput. Oper. Res., 1995

Using artificial neural networks to solve the orienteering problem.
Ann. Oper. Res., 1995

Exchange heuristics to improve the clarity of base/time plots.
Comput. Oper. Res., 1994

A transportation problem formulation for the MAC Airlift Planning problem.
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

From the Editor.
INFORMS J. Comput., 1993

A neural network model for the wire bonding process.
Comput. Oper. Res., 1993

A simulation study of donor scheduling systems for the American Red Cross.
Comput. Oper. Res., 1993

Large-scale controlled rounding using tabu search with strategic oscillation.
Ann. Oper. Res., 1993

Cell suppression: Disclosure protection for sensitive tabular data.
Networks, 1992

Predicting salinity in the chesapeake bay using backpropagation.
Comput. Oper. Res., 1992

A new heuristic for the linear placement problem.
Comput. Oper. Res., 1991

Using simulation to study the impact of work rules on productivity at marine container terminals.
Comput. Oper. Res., 1991

Controlled Rounding of Tabular Data.
Oper. Res., 1990

Using Simulated Annealing to Solve Controlled Rounding Problems.
INFORMS J. Comput., 1990

State-of-the-art in nonlinear optimization software for the microcomputer.
Comput. Oper. Res., 1989

Computing <i>k</i>-shortest path lengths in euclidean networks.
Networks, 1987

OR Practice - Computerized Vehicle Routing in the Soft Drink Industry.
Oper. Res., 1987

Transforming arc routing into node routing problems.
Comput. Oper. Res., 1987

OR Forum - Perspectives on Vehicle Routing: Exciting New Developments.
Oper. Res., 1986

Nonlinear programming on a microcomputer.
Comput. Oper. Res., 1986

Decision insight systems for microcomputers: A critical evaluation.
Comput. Oper. Res., 1986

Microcomputer-based vehicle routing and scheduling software.
Comput. Oper. Res., 1986

Comput. Oper. Res., 1986

Expert systems, microcomputers, and operations research.
Comput. Oper. Res., 1986

Garage Location for an Urban Mass Transit System.
Transp. Sci., 1984

The fleet size and mix vehicle routing problem.
Comput. Oper. Res., 1984

Computational experiments with algorithms for a class of routing problems.
Comput. Oper. Res., 1983

Optimization by simulated annealing: A preliminary computational study for the TSP.
Proceedings of the 15th conference on Winter simulation, 1983

IEEE Trans. Syst. Man Cybern., 1982

Network techniques for solving asset diversification problems in finance.
Comput. Oper. Res., 1982

A Preliminary Framework for Urban Model-Building.
Proceedings of the Adequate Modeling of Systems, 1982

Capacitated arc routing problems.
Networks, 1981

Networks, 1981

Classification in vehicle routing and scheduling.
Networks, 1981

Current and future research directions in network optimization.
Comput. Oper. Res., 1981

Location on networks: Theory and algorithms, Gabriel Handler and Pitu Mirchandani, MIT Press, Cambridge, 1979, 233 pp. Price: $20.00.
Networks, 1980

Approximate Traveling Salesman Algorithms.
Oper. Res., 1980

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

Models and solution techniques for cash flow management.
Comput. Oper. Res., 1979

Shortest paths with euclidean distances: An explanatory model.
Networks, 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

Implementing vehicle routing algorithms.
Networks, 1977

Deterministic network optimization: A bibliography.
Networks, 1977

A statistical approach to the tsp.
Networks, 1977

Technical Note - Shortest-Path Algorithms: A Comparison.
Oper. Res., 1976

A minimum-cost multicommodity network flow problem concerning imports and exports.
Networks, 1975