William R. Stewart

TL;DR: The design of computational experiments to test heuristic methods and reporting guidelines for such experimentation are discussed and the goal is to promote thoughtful, well-planned, and extensive testing of heuristics and integrity in and reproducibility of the reported results.

TL;DR: It is shown that the optimal solution to a linear program that solves the mixed integer program has dual variables that have the traditional economic interpretation as prices, and can be used to interpret the solutions to nonconvex problems such as the problem discussed by Scarf.

TL;DR: One of the major conclusions is that it is not difficult to get within 2–3% of optimality using a composite heuristic which requires on the order of n3 computations where n is the number of nodes in the network.

TL;DR: Several formulations and heuristic algorithms for solving the vehicle routing problem when the demands at individual delivery (pickup) locations behave as random variables are presented.

TL;DR: In this article, the authors examined non-cooperative behavior among producers and calculated a Nash equilibrium under different market specifications in two-node and four-node networks, and found that increasing competition at one node increases the consumer price at a second node and causes an overall decrease in consumer surplus.