pith. sign in

Title resolution pending

Pre-publication version available at https://yasminebeck · 1973 · DOI 10.1287/opre.21.1

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.OC 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Price of Coupling in Multilevel Linear Programming

math.OC · 2026-05-24 · unverdicted · novelty 7.0

k-level LP feasibility is Σ^p_{k-1}-complete for k≥2, polynomial for k≤4 without coupling and unbounded variables but Σ^p_{k-1}-complete for k≥5; optimal value is FΔ^p_k-complete for k≥2 even without coupling.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Price of Coupling in Multilevel Linear Programming math.OC · 2026-05-24 · unverdicted · none · ref 2

    k-level LP feasibility is Σ^p_{k-1}-complete for k≥2, polynomial for k≤4 without coupling and unbounded variables but Σ^p_{k-1}-complete for k≥5; optimal value is FΔ^p_k-complete for k≥2 even without coupling.