A reverse search algorithm for the neighborhood problem

DOI10.1016/S0167-6377(99)00026-7MaRDI QIDQ1306348zbMATH OpenFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 3896665
• Reverse search for enumeration
• Neighborhood-following algorithms for linear programming
• The sensitivity analysis of linear programming based on the improved basic line algorithm

Cites work

• scientific article; zbMATH DE number 3825556 (Why is no real title available?)
• scientific article; zbMATH DE number 1395341 (Why is no real title available?)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• A reverse search algorithm for the neighborhood problem
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
• Bounds on the number of vertices of perturbed polyhedra
• Degeneracy graphs and the neighbourhood problem
• How good are convex hull algorithms?
• Sensitivity analysis in linear programming: Just be careful!

Cited in

(2)

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

This page was built for publication: A reverse search algorithm for the neighborhood problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306348)