An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem.
Year of publication: |
1991
|
---|---|
Authors: | Miller, D.L. ; Pekny, J.F. ; Thompson, G.L. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | economic models | mathematics |
-
Two Index Theorems for Bandit Problems.
Banks, J.s., (1991)
-
Banks, J.s., (1991)
-
An Algorithm to Find Out If the Intersection of M Convex Polyhedral Cones Has a Non Empty Interior
Boyer, M., (1976)
- More ...
-
A SPARSE MATRIX TECHNIQUE FOR PARALLEL SOLUTION OF FULLY DENSE TRANSPORTATION PROBLEMS
MILLER, D.L., (1988)
-
Miller, D.L., (1991)
-
Sealed Bid Auctions and Economic Market Game.
Thompson, G.L., (1992)
- More ...