Nonlinear 0-1 programming. II: Dominance relations and algorithms

From MaRDI portal





In part I of this paper (see the preceding review) the authors defined a family \({\mathcal F}\) of linear inequalities that contains a linearization of a multilinear 0-1 program \[ (MLP)\quad \max \{f_ 0(x):\quad f_ k(x)\leq b_ k,\quad k\in K,\quad x\quad binary\}, \] having fewer elements than the family based on the generalized covering inequalities. Here, the dominance relations between inequalities of \({\mathcal F}\) are analyzed. A criterion, which can be checked in linear time, is given for deciding whether a generalized covering inequality can be strengthened by extending the cover from which it was derived. Based on these results a class of algorithms for solving (MLP) is described and extensive computational experience is reported.




Cited in
(22)








This page was built for publication: Nonlinear 0-1 programming. II: Dominance relations and algorithms

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