A reverse search algorithm for the neighborhood problem

DOI10.1016/S0167-6377(99)00026-7zbMATH Open0941.90054MaRDI QIDQ1306348FDOQ1306348

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)

Cites Work

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

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)