On Convex Minimization over Base Polytopes

DOI10.1007/978-3-540-72792-7_20MaRDI QIDQ5429272zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Equivalence of convex minimization problems over base polytopes
• scientific article; zbMATH DE number 647670
• scientific article; zbMATH DE number 3873086
• scientific article; zbMATH DE number 4137537
• scientific article; zbMATH DE number 1953186

Cited in

(13)

• Convex integer maximization via Graver bases
• Equivalence of convex minimization problems over base polytopes
• Decreasing minimization on M-convex sets: background and structures
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
• A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
• Theory of principal partitions revisited
• scientific article; zbMATH DE number 3873086 (Why is no real title available?)
• Concave Minimization Via Collapsing Polytopes
• Minimizing symmetric convex functions over hybrid of continuous and discrete convex sets
• Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods
• Structural and algorithmic properties for parametric minimum cuts
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
• Eisenberg-Gale markets: algorithms and game-theoretic properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429272)