A primal-dual cutting-plane algorithm for all-integer programming

DOI10.1002/NAV.3800280405MaRDI QIDQ3320128zbMATH OpenOpenAlexFDO

Authors Parviz Ghandforoush, Larry M. Austin

Publication date 1981

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800280405

zbMATH Keywords

all-integer programmingprimal-dual) cutting-plane method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• The mixed cutting plane algorithm for all-integer programming
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Publication:4207787
• Primal cutting plane algorithms revisited
• A simple finite cutting plane algorithm for integer programs

Cites work

• Notes on automorphic functions: an entire automorphic form of positive dimension is zero

Cited in

(14)

• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Solution approaches for highly primal- and dual-degenerate all-integer programming problems
• New technique for solving primal all-integer linear programming
• Primal cutting plane algorithms revisited
• An intelligent algorithm for mixed-integer programming models
• The mixed cutting plane algorithm for all-integer programming
• An advanced start algorithm for all-integer programming
• Primal-dual simplex method for shooting
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• A primal dual integer programming algorithm
• scientific article; zbMATH DE number 4128658 (Why is no real title available?)
• scientific article; zbMATH DE number 3898610 (Why is no real title available?)
• A surrogate cutting plane algorithm for all-integer programming
• A primal all-integer algorithm based on irreducible solutions

This page was built for publication: A primal-dual cutting-plane algorithm for all-integer programming

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