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

DOI10.1002/NAV.3800280405zbMATH Open0535.90067OpenAlexW1983132195MaRDI QIDQ3320128FDOQ3320128

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

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

zbMATH Keywords

all-integer programmingprimal-dual) cutting-plane method

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• New technique for solving primal all-integer linear programming
• A primal dual integer programming algorithm
• A primal all-integer algorithm based on irreducible solutions
• Title not available (Why is that?)
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Primal cutting plane algorithms revisited
• Title not available (Why is that?)
• The mixed cutting plane algorithm for all-integer programming
• A surrogate cutting plane algorithm for all-integer programming
• An intelligent algorithm for mixed-integer programming models
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• An advanced start algorithm for all-integer programming
• Primal-dual simplex method for shooting
• Solution approaches for highly primal- and dual-degenerate all-integer programming problems

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)