A framework of discrete DC programming by discrete convex analysis
- 2 July 2014
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 152 (1-2) , 435-466
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- On difference convexity of locally Lipschitz functionsOptimization, 2011
- New algorithms for convex cost tension problem with application to computer visionDiscrete Optimization, 2009
- A faster strongly polynomial time algorithm for submodular function minimizationMathematical Programming, 2007
- Discrete Hessian Matrix for L-Convex FunctionsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005
- Submodular function minimization in and searching in Monge arraysElectronic Notes in Discrete Mathematics, 2004
- The Concave-Convex ProcedureNeural Computation, 2003
- Submodular containment is hard, even for networksOperations Research Letters, 1996
- A Fenchel-Rockafellar type duality theorem for maximizationBulletin of the Australian Mathematical Society, 1979
- On functions representable as a difference of convex functionsPacific Journal of Mathematics, 1959
- Rings of setsDuke Mathematical Journal, 1937