Complexity of the gravitational method for linear programming

DOI10.1007/3-540-62034-6_51MaRDI QIDQ6567772zbMATH OpenFDO

Authors Thomas Morin, N. Prabhu, Z. Zhang

Publication date 5 July 2024

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• The d-Step Conjecture and Its Relatives
• The gravitational method for linear programming
• The steepest descent gravitational method for linear programming

This page was built for publication: Complexity of the gravitational method for linear programming

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