The following pages link to Bruce Golden (Q180484):
Displaying 50 items.
- Multi-visit drone routing problem (Q2333150) (← links)
- Large-scale controlled rounding using tabu search with strategic oscillation (Q2366995) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
- The prize-collecting generalized minimum spanning tree problem (Q2476612) (← links)
- Very large-scale vehicle routing: new test problems, algorithms, and results (Q2485169) (← links)
- A divide-and-conquer local search heuristic for data visualization (Q2499138) (← links)
- Diversification for better classification trees (Q2499153) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- Optimal TSP tour length estimation using standard deviation as a predictor (Q2676394) (← links)
- Optimal TSP tour length estimation using Sammon maps (Q2679001) (← links)
- Using regression models to understand the impact of route-length variability in practical vehicle routing (Q2679006) (← links)
- The generalized covering salesman problem (Q2815466) (← links)
- A genetic algorithm-based approach for building accurate decision trees (Q2884546) (← links)
- Heuristic search for the generalized minimum spanning tree problem (Q2890473) (← links)
- The multilevel capacitated minimum spanning tree problem (Q2892295) (← links)
- MRSA transmission reduction using agent-based modeling and simulation (Q2899094) (← links)
- A parallel algorithm for the vehicle routing problem (Q2899121) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- The balanced billing cycle vehicle routing problem (Q3057123) (← links)
- (Q3084298) (← links)
- (Q3084304) (← links)
- (Q3084324) (← links)
- (Q3343723) (← links)
- Interactive Reliability Analysis on a Microcomputer (Q3350597) (← links)
- Controlled Rounding of Tabular Data (Q3356124) (← links)
- The Mothership and Drone Routing Problem (Q3386760) (← links)
- A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem (Q3439967) (← links)
- The Colorful Traveling Salesman Problem (Q3439974) (← links)
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach (Q3439978) (← links)
- (Q3447236) (← links)
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (Q3564373) (← links)
- Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees (Q3637397) (← links)
- A new heuristic for determining fleet size and composition (Q3712124) (← links)
- (Q3720323) (← links)
- Using simulated annealing to solve routing and location problems (Q3724091) (← links)
- (Q3725851) (← links)
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097) (← links)
- Computingk-shortest path lengths in euclidean networks (Q3790962) (← links)
- The orienteering problem (Q3792511) (← links)
- A multifaceted heuristic for the orienteering problem (Q3795496) (← links)
- Simulated Annealing – An Annotated Bibliography (Q3823079) (← links)
- (Q3859549) (← links)
- A note on determining operating strategies for probabilistic vehicle routing (Q3869086) (← links)
- Approximate Traveling Salesman Algorithms (Q3893692) (← links)
- Capacitated arc routing problems (Q3910337) (← links)
- (Q3955125) (← links)
- Cell suppression: Disclosure protection for sensitive tabular data (Q4018997) (← links)
- Using Simulated Annealing to Solve Controlled Rounding Problems (Q4029058) (← links)
- Counting Trees in a Certain Class of Graphs (Q4050634) (← links)
