A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
type: Item
instance of: scholarly article
title: A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
zbMATH Open document ID: 1257.93033
author: Mathias Bürger
author: Giuseppe Notarstefano
author: Frank Allgöwer
author: Francesco Bullo
published in: Automatica
publication date: 2013-03-01T00:00:00Z
Mathematics Subject Classification ID: 93B40
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6140469
zbMATH Keywords: distributed simplex
zbMATH Keywords: distributed linear programming
zbMATH Keywords: asynchronous algorithm
zbMATH Keywords: multi-agent task assignment
describes a project that uses: ASYNPLEX
MaRDI profile type: Publication
full work available at URL: j.automatica.2012.06.040
OpenAlex ID: W2045294654
Wikidata QID: Q59048629
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: Q4225395
cites work: Selected topics on assignment problems
cites work: The Decomposition Algorithm for Linear Programs
cites work: The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
cites work: Linear programming — Randomization and abstract frameworks
cites work: ASYNPLEX, an asynchronous parallel revised simplex algorithm
cites work: Lexicographic perturbation for multiparametric linear programming with applications to control
cites work: An approach to nonlinear programming
cites work: Distributed Task Assignment for Mobile Agents
cites work: Constrained Consensus and Optimization in Multi-Agent Networks
cites work: Distributed Abstract Optimization via Constraints Consensus: Theory and Applications
cites work: Monotonic Target Assignment for Robotic Networks
cites work: On Distributed Convex Optimization Under Inequality and Equality Constraints
DOI: 10.1016/J.AUTOMATICA.2012.06.040
description: scientific article; zbMATH DE number 6140469