Complexity of the gravitational method for linear programming
type: Item
instance of: scholarly article
title: Complexity of the gravitational method for linear programming
zbMATH Open document ID: 1540.90153
DOI: 10.1007/3-540-62034-6_51
author: Thomas Morin
author: N. Prabhu
author: Z. Zhang
publication date: 2024-07-05T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7876728
MaRDI profile type: Publication
cites work: The steepest descent gravitational method for linear programming
cites work: Q3844775
cites work: The d-Step Conjecture and Its Relatives
cites work: Q4051879
cites work: The gravitational method for linear programming
description: scientific article; zbMATH DE number 7876728