The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques

DOI10.1007/BF01681352MaRDI QIDQ4083209zbMATH OpenFDO

Authors

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3219393 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A New Foundation for a Simplified Primal Integer Programming Algorithm
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• A primal (all-integer) integer programming algorithm
• Iteration Skipping in Primal Integer Programming
• Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm

This page was built for publication: The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques

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