A reverse search algorithm for the neighborhood problem
type: Item
instance of: scholarly article
title: A reverse search algorithm for the neighborhood problem
zbMATH Open document ID: 0941.90054
DOI: 10.1016/S0167-6377(99)00026-7
author: Carlo Filippi
published in: Operations Research Letters
publication date: 1999-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 1347051
zbMATH Keywords: linear optimization
zbMATH Keywords: neighborhood problem
zbMATH Keywords: sensitivity analysis
MaRDI profile type: Publication
cites work: Bounds on the number of vertices of perturbed polyhedra
cites work: Q4935168
cites work: How good are convex hull algorithms?
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex
cites work: Sensitivity analysis in linear programming: Just be careful!
cites work: Degeneracy graphs and the neighbourhood problem
cites work: Q3671749
description: scientific article; zbMATH DE number 1347051