Complexity of the gravitational method for linear programming

DOI10.1007/3-540-62034-6_51zbMATH Open1540.90153MaRDI QIDQ6567772FDOQ6567772

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• The gravitational method for linear programming
• The d-Step Conjecture and Its Relatives
• 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)