Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints

DOI10.1137/080717675zbMath1189.90119OpenAlexW2088338060MaRDI QIDQ3563909

Takumi Hayashi, Satoru Fujishige, Kiyohito Nagano

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080717675

zbMATH Keywords

algorithmssubmodular functionsdiscrete convex functions

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27)

Related Items (3)

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ Theory of Principal Partitions Revisited ⋮ Some specially structured assemble-to-order systems

This page was built for publication: Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints