The bounded simplex method to solve the 0-1 linear integer programming problem

MaRDI QIDQ5260302zbMATH OpenFDO

Authors Huizhen Zhang, Xin Wei, Liang Ma

Publication date 29 June 2015

zbMATH Keywords

0-1 programmingbounded simplex methodpivoting iteration

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Linear programming (90C05) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 1094193
• scientific article; zbMATH DE number 1497345
• scientific article; zbMATH DE number 1953199
• scientific article; zbMATH DE number 549930
• The bound improving sequence algorithm

Cited in

(4)

• The bound improving sequence algorithm
• scientific article; zbMATH DE number 5000797 (Why is no real title available?)
• scientific article; zbMATH DE number 1094193 (Why is no real title available?)
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem

This page was built for publication: The bounded simplex method to solve the 0-1 linear integer programming problem

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