scientific article; zbMATH DE number 4068611

MaRDI QIDQ3801338zbMATH OpenFDO

Authors Rumen Andonov

Publication date 1988

zbMATH Keywords

0-1 linear programmingequivalent formulationminimal covers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• A MAX-CUT formulation of 0/1 programs
• Stronger linear programming relaxations of max-cut
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• A disjunctive cut strengthening technique for convex MINLP
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• An approximation algorithm for the partial covering 0-1 integer program
• scientific article; zbMATH DE number 2206808
• A branch-and-bound algorithm for the minimum cut linear arrangement problem
• Integer Linear Programs and Local Search for Max-Cut
• Linear programming relaxations of \textsc{maxcut}

Cited in

(1)

• Lifting inequalities: a framework for generating strong cuts for nonlinear programs

This page was built for publication:

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