Integer Programming Subject to Monomial Constraints

DOI10.1137/090764402zbMATH Open1211.90134OpenAlexW2038007230MaRDI QIDQ3083332FDOQ3083332

Dennis Michaels, Robert Weismantel, Christoph Buchheim

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

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

zbMATH Keywords

integer nonlinear programmingmonomial constraints

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Error bounds for monomial convexification in polynomial optimization
• Integer programming approach to static monopolies in graphs

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)