The complexity of computing the Muirhead-Dalton distance
Year of publication: |
2009
|
---|---|
Authors: | Deineko, Vladimir G. ; Klinz, Bettina ; Woeginger, Gerhard J. |
Published in: |
Mathematical social sciences. - Amsterdam [u.a.] : NH, Elsevier, ISSN 0165-4896, ZDB-ID 283230-6. - Vol. 57.2009, 2, p. 282-284
|
Subject: | Computerunterstützung | Computerized method | Theorie | Theory | Geographische Entfernung | Geographic distance | Computer |
-
Automated preparation of input to computers
(1965)
-
Computing puiseux-series explansion via combinatorial relaxation
Murota, Kazuo, (1989)
-
Automating the computation of solutions of large economic models
Pearson, K. R., (1986)
- More ...
-
The complexity of computing the Muirhead-Dalton distance
Deineko, Vladimir G., (2009)
-
Uniqueness in quadratic and hyperbolic 0-1 programming problems
Deineko, Vladimir G., (2013)
-
The bipartite travelling salesman problem : a pyramidally solvable case
Deineko, Vladimir G., (2024)
- More ...