Min-Max MPC based on a computationally efficient upper bound of the worst case cost | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

Min-Max MPC based on a computationally efficient upper bound of the worst case cost

Identifier:nobleid.org/w1/20260515/E622E2AB

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/E622E2AB.svg?ark=w1%2F20260515%2FE622E2AB)](https://nobleid.org/work/w1/20260515/E622E2AB)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

D.R. Ramı́rez

Eduardo F. Camacho

David Muñoz de la Peña

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy Pricing