Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal

Publication:3352842

Jump to:navigation, search

zbMath0728.90062MaRDI QIDQ3352842

Ravindran Kannan

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

feasibility test parametric integer programs polynomial-time decision procedure copolytope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (8)

Short Presburger Arithmetic Is Hard ⋮ The Computational Complexity of Integer Programming with Alternations ⋮ On the number of integer points in translated and expanded polyhedra ⋮ A randomized sieving algorithm for approximate integer programming ⋮ Enumerating Projections of Integer Points in Unbounded Polyhedra ⋮ Parameterized resiliency problems ⋮ Unnamed Item ⋮ Computing the covering radius of a polytope with an application to lonely runners

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3352842&oldid=16607305"