scientific article; zbMATH DE number 1094193

MaRDI QIDQ4368227zbMATH OpenFDO

Authors Min Ren

Publication date 3 December 1997

zbMATH Keywords

simplex method

Mathematics Subject Classification ID

Linear programming (90C05) Boolean programming (90C09)

Recommendations

• The bounded simplex method to solve the 0-1 linear integer programming problem
• scientific article; zbMATH DE number 3906237
• A heuristic 0-1 integer programming method
• scientific article; zbMATH DE number 3904325

Cited in

(7)

• A heuristic 0-1 integer programming method
• scientific article; zbMATH DE number 1801377 (Why is no real title available?)
• scientific article; zbMATH DE number 3906237 (Why is no real title available?)
• An improved enumeration for pure 0-1 programs
• scientific article; zbMATH DE number 1839616 (Why is no real title available?)
• The bounded simplex method to solve the 0-1 linear integer programming problem
• A class of polynomially solvable 0-1 programming problems and an application

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 Q4368227)