On Convex Minimization over Base Polytopes

DOI10.1007/978-3-540-72792-7_20zbMath1136.90436OpenAlexW1560085727MaRDI QIDQ5429272

Kiyohito Nagano

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_20

zbMATH Keywords

convex optimizationsubmodular functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization ⋮ Theory of Principal Partitions Revisited ⋮ Structural and algorithmic properties for parametric minimum cuts ⋮ Eisenberg-Gale markets: algorithms and game-theoretic properties ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives ⋮ Decreasing minimization on M-convex sets: background and structures

This page was built for publication: On Convex Minimization over Base Polytopes