An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
From MaRDI portal
Publication:4016776
DOI10.1051/RO/1992260101131zbMATH Open0764.90058OpenAlexW2511806218MaRDI QIDQ4016776
Publication date: 16 January 1993
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105025
Integer programming (90C10) Nonlinear programming (90C30) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (2)
The Boolean quadratic programming problem with generalized upper bound constraints ⋮ Title not available (Why is that?)
This page was built for publication: An efficient method for obtaining sharp bounds for nonlinear boolean programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016776)
