Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Bruce L. Golden
Information about the author Bruce L. Golden will soon be added to the site.
Found
24 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A divide-and-conquer local search heuristic for data visualization
2006
Data visualization techniques have become important tools for analyzing large...
Diversification for better classification trees
2006
Classification trees are widely used in the data mining community. Typically, trees...
Very large-scale vehicle routing: new test problems, algorithms, and results
2005
The standard vehicle routing problem was introduced in the OR/MS literature about 45...
Linear programming models for estimating weights in the analytic hierarchy process
2005
We present an approach based on linear programming (LP) that estimates the weights for...
Old world vs. new world: Evolution of Nobel Prize shares
2005
We study current and past trends in the geographic distribution of Nobel Prize awards....
A genetic algorithm-based approach for building accurate decision trees
2003
In dealing with a very large data set, it might be impractical to construct a decision...
A computational study of smoothing heuristics for the traveling salesman problem
2000
Over the last five years or so, data smoothing has been used to improve the...
A hierarchical strategy for solving traveling salesman problems using elastic nets
1995
In this article, we focus on implementing the elastic net method to solve the...
A computational study of a new heuristic for the site-dependent vehicle routing problem
1999
In the site-dependent vehicle routing problem, a fleet of heterogeneous vehicles...
Predicting the success of nations at the Summer Olympics using neural networks
1999
In this paper, we construct several models that try to predict a country's success at...
The team orienteering problem
1996
In the team orienteering problem, start and end points are specified along with other...
A fast and effective heuristic for the orienteering problem
1996
In the orienteering problem, start and end points are specified along with other...
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
1997
We propose an heuristic for a class of vehicle routing problems (VRPs) with minmax...
The controlled rounding problem: Complexity and computational experience
1993
Controlled rounding is a procedure whereby tabular data gathered from respondents is...
Using artificial neural networks to solve the orienteering problem
1995
In the orienteering problem, the authors are given a transportation network in which a...
A new heurisic for the period traveling salesman problem
1995
In this paper, a new heuristic for the period traveling salesman problem is presented....
Exchange heuristics to improve the clarity of base/time plots
1994
Motivated by a problem encountered by the Military Airlift Command (now replaced by...
A transportation problem formulation for the MAC Airlift Planning Problem
1994
The Military Airlift Command (MAC) is responsible for planning the allocation of...
Large-scale controlled rounding using tabu search with strategic oscillation
1993
When publishing tabular data, the United States Bureau of the Census must sometimes...
A simulation study of donor scheduling systems for the American Red Cross
1993
The authors use computer simulation to evaluate several strategies for scheduling the...
Using simulation to study the impact of work rules on productivity at marine container terminals
1991
In this paper, the authors describe a simulation program that models the transfer of...
Controlled rounding of tabular data
1990
Controlled rounding is a procedure that perturbs tabular data collected from...
Finding the most vital arcs in a network
1989
Let be a directed, arc weighted network with node set V and arc set A . Associated...
Solving k-shortest and constrained shortest path problems efficiently
1989
In this paper, the authors examine the problems of finding the k- shortest paths, the...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers