scientific article
From MaRDI portal
Publication:2743980
zbMath0968.90510MaRDI QIDQ2743980
Pravin M. Vaidya, David S. Atkinson
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)
Related Items (5)
Volumetric path following algorithms for linear programming ⋮ Large step volumetric potential reduction algorithms for linear programming ⋮ A utility theory based interactive approach to robustness in linear optimization ⋮ The mixing time of the Dikin walk in a polytope -- a simple proof ⋮ Unnamed Item
This page was built for publication:
