A reverse search algorithm for the neighborhood problem

DOI10.1016/S0167-6377(99)00026-7zbMath0941.90054MaRDI QIDQ1306348

Carlo Filippi

Publication date: 19 December 1999

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

sensitivity analysislinear optimizationneighborhood problem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

Computing monotone disjoint paths on polytopes ⋮ A reverse search algorithm for the neighborhood problem

Cites Work

• Degeneracy graphs and the neighbourhood problem
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Sensitivity analysis in linear programming: Just be careful!
• A reverse search algorithm for the neighborhood problem
• Bounds on the number of vertices of perturbed polyhedra
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• How good are convex hull algorithms?
• Unnamed Item
• Unnamed Item