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: | Mathematische Optimierung | Mathematical programming | Geographische Entfernung | Geographic distance | Komplexe Systeme | Complex systems | Computerunterstützung | Computerized method | Theorie | Theory | Komplexitätsmanagement | Complexity management |
-
The complexity of computing the MCD-estimator
Bernholt, Thorsten, (2001)
-
Computer aided complexity classification of deterministic scheduling problems
Lageweg, B., (1981)
-
Organizational complexity and computation
Eisenhardt, Kathleen M., (2002)
- 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)
-
A note on the complexity of the transportation problem with a permutable demand vector
Hujter, Mihály, (1999)
- More ...