No abstract available.

Long-distance telephone companies in the United States pay access fees to local telephone companies to transport calls that originate and terminate on their networks. These charges form the largest portion of the cost of providing long-distance service. Recent changes in the structure of access...

This paper presents an introductory survey for this special issue of Management Science on electronic markets. We acquaint the reader with some fundamental concepts in the study of electronic market mechanisms, while simultaneously presenting a survey and summary of the essential literature in...

Motivated by the increasing use of auctions by government agencies, we consider the problem of fairly pricing public goods in a combinatorial auction. A well-known problem with the incentive-compatible Vickrey-Clarke-Groves (VCG) auction mechanism is that the resulting prices may not be in the...

Many algorithms have been developed for the optimal solution of the asymmetric travelling salesman problem: the most efficient ones are based on the subtour elimination approach. This paper presents a breadth-first branch and bound algorithm which differs from the method of Smith, Srinivasan and...

We present a new algorithm for the optimal solution of the 0-1 Knapsack problem, which is particularly effective for large-size problems. The algorithm is based on determination of an appropriate small subset of items and the solution of the corresponding "core problem": from this we derive a...

Erratum to Carpaneto, Giorgio, Paolo Toth. 1980. Branching and bounding criteria for the asymmetric travelling salesman problem. Management Sci. 26 (7) 736--743.

Two new algorithms recently proved to outperform all previous methods for the exact solution of the 0-1 Knapsack Problem. This paper presents a combination of such approaches, where, in addition, valid inequalities are generated and surrogate relaxed, and a new initial core problem is adopted....

Crew and vehicle scheduling are fundamental issues in public transit management. Informally, they can be described as the problem of determining the optimal duties for a set of crews (e.g., bus drivers) or vehicles (e.g., buses) so as to cover a given set of timetabled trips, satisfying a number...

Several branch-and-bound algorithms for the exact solution of the asymmetric traveling salesman problem (ATSP), based on the assignment problem (AP) relaxation, have been proposed in the literature. These algorithms perform very well for some instances (e.g., those with uniformly random integer...