A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees

DOI10.1016/j.automatica.2019.01.009zbMath1415.93016arXiv1706.08788OpenAlexW2963585731MaRDI QIDQ1737812

Kostas Margellos, Alessandro Falsone, Maria Prandini

Publication date: 24 April 2019

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.08788

zbMATH Keywords

decentralized optimizationelectric vehiclesMILPmulti-agent networks

Mathematics Subject Classification ID

Mixed integer programming (90C11) Application models in control theory (93C95) Decentralized systems (93A14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition method for large scale MILPs, with performance guarantees and a power system application
• Bounding duality gap for separable problems with linear constraints
• Control of systems integrating logic, dynamics, and constraints
• Dual decomposition for multi-agent distributed optimization with coupling constraints
• Portfolio-optimization models for small investors
• Effective Heuristics for Multiproduct Partial Shipment Models
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• Optimal short-term scheduling of large-scale power systems
• Estimates of the Duality Gap in Nonconvex Optimization

This page was built for publication: A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees