A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems

Pages:1–9

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.1

A GRASP for the Vehicle Routing Problem with Time Windows

Pages:10–23

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.10

The Distribution Problem with Carrier Service: A Dual Based Penalty Approach

Pages:24–35

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.24

Numerical Inversion of Laplace Transforms of Probability Distributions

Pages:36–43

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.36

Preprocessing in Stochastic Programming: The Case of Capacitated Networks

Pages:44–62

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.44

Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

Pages:63–77

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.63

Hulls and Efficient Sets for the Rectilinear Norm

Pages:78–83

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.78

Disjoint Paths in the Plane

Pages:84–88

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.84

Efficient Computation of Probabilities of Events Described by Order Statistics and Applications to Queue Inference

Pages:89–100

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.89

Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain

Pages:101–108

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.101

A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems

Pages:109–116

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.109

Erratum

Pages:116–116

Published Online:February 1, 1995

https://doi.org/10.1287/ijoc.7.1.116

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.