An Exact Algorithm for Finding Undirectd Hamiltonian Cycles Based on a Two-Matching Problem Relaxation.
Year of publication: |
1991
|
---|---|
Authors: | Miller, D.L. ; Pekny, J.F ; Thompson, G.L. |
Institutions: | Carnegie Mellon University, Tepper School of Business |
Subject: | mathematics | economic theory |
-
Mathematics in economics : a perspective on necessity and sufficiency
Palaşcǎ, Silvia, (2013)
-
Applying mathematics to economics according to Cournot and Walras
Ragni, Ludovic, (2018)
-
Pioneers' arguments for formulating economic problems mathematically : a (partial) survey
Sandelin, Bo, (2017)
- More ...
-
An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem.
Miller, D.L., (1991)
-
A SPARSE MATRIX TECHNIQUE FOR PARALLEL SOLUTION OF FULLY DENSE TRANSPORTATION PROBLEMS
MILLER, D.L., (1988)
-
Sealed Bid Auctions and Economic Market Game.
Thompson, G.L., (1992)
- More ...