The complexity of minimizing the difference of two M⇋-convex set functions
Year of publication: |
November 2015
|
---|---|
Authors: | Kobayashi, Yusuke |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 6, p. 573-574
|
Subject: | M⇋-convex set functions | DC programming | Matroid | NP-hardness | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Static and dynamic source locations in undirected networks
Turner, Lara Ruth, (2015)
-
A DC programming heuristic applied to the logistics network design problem
Thanh, Phuong Nga, (2011)
-
DCA based algorithms for multiple sequence alignment (MSA)
Thi, Hoai An Le, (2014)
- More ...
-
A Price Is a Signal: on Intrinsic Motivation, Crowding-out, and Crowding-in
Iwata, Satoru, (2010)
-
Otsuki, Kensuke, (2016)
-
Two disjoint shortest paths problem with non-negative edge length
Kobayashi, Yusuke, (2019)
- More ...