Convex discrete optimization

MaRDI QIDQ2928711zbMATH OpenFDO

Authors Shmuel Onn

Publication date 10 November 2014

Full work available at URL https://arxiv.org/abs/math/0703575

zbMATH Keywords

\(n\)-fold integer programmingaugmentationclusteringcombinatorial optimizationcontingency tableconvex optimizationdata securitydisclosure controldiscrete optimizationedge directionGraver baseGraver complexityinteger programmingmarginmatroidmulti criteria optimizationmultiindex transportation problemmultiway tablenonlinear optimizationpartitioningpolynomial timepolytopeprivacy in databasesspanning treestatistical tabletest settransportation problemzonotope

Mathematics Subject Classification ID

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

Recommendations

• Convex combinatorial optimization
• Convex integer maximization via Graver bases
• Nonlinear discrete optimization. An algorithmic theory
• Theory and Applications of n-Fold Integer Programming
• A polynomial oracle-time algorithm for convex integer minimization

Cited in

(11)

• Discrete optimization under interval uncertainty
• Convex combinatorial optimization
• On approximation algorithms for concave mixed-integer quadratic programming
• Convex integer optimization by constantly many linear counterparts
• On a primal-proximal heuristic in discrete optimization
• Constructive Discrepancy Minimization for Convex Sets
• scientific article; zbMATH DE number 432992 (Why is no real title available?)
• scientific article; zbMATH DE number 2159405 (Why is no real title available?)
• Combinatorial Image Analysis
• Discrete problem of convex combinations and its applications
• Nonlinear discrete optimization. An algorithmic theory

This page was built for publication: Convex discrete optimization

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