Integer Programming Subject to Monomial Constraints

DOI10.1137/090764402MaRDI QIDQ3083332zbMATH OpenOpenAlexFDO

Authors Christoph Buchheim, Dennis Michaels, Robert Weismantel

Publication date 21 March 2011

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

Full work available at URL http://e-archive.informatik.uni-koeln.de/591/2/zaik2009-591.pdf

zbMATH Keywords

integer nonlinear programmingmonomial constraints

Mathematics Subject Classification ID

Nonlinear programming (90C30) Integer programming (90C10)

Recommendations

• Applications and efficient algorithms for integer programming problems on monotone constraints
• scientific article; zbMATH DE number 7124428
• scientific article; zbMATH DE number 14318
• scientific article; zbMATH DE number 549930
• scientific article; zbMATH DE number 3908168
• Integer Programming
• scientific article; zbMATH DE number 1312984
• Integer Programming
• scientific article; zbMATH DE number 1163810

Cited in

(5)

• Error bounds for monomial convexification in polynomial optimization
• The integrality number of an integer program
• Applications and efficient algorithms for integer programming problems on monotone constraints
• Integer programming approach to static monopolies in graphs
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)

This page was built for publication: Integer Programming Subject to Monomial Constraints

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