scientific article

zbMATH Open0654.90056MaRDI QIDQ3801338

Rumen Andonov

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

minimal covers0-1 linear programmingequivalent formulation

Mathematics Subject Classification ID

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

Related Items (1)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs 👍 👎
• Stronger linear programming relaxations of max-cut 👍 👎
• A MAX-CUT formulation of 0/1 programs 👍 👎
• A recursive procedure to generate all cuts for 0-1 mixed integer programs 👍 👎
• A branch-and-bound algorithm for the minimum cut linear arrangement problem 👍 👎
• A disjunctive cut strengthening technique for convex MINLP 👍 👎
• An approximation algorithm for the partial covering 0-1 integer program 👍 👎
• Integer Linear Programs and Local Search for Max-Cut 👍 👎

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)