The effectiveness of finite improvement algorithms for finding global optima

DOI10.1007/BF01415994zbMATH Open0788.68061OpenAlexW1992196549MaRDI QIDQ4201810FDOQ4201810

Authors: Sheldon H. Jacobson, Daniel Solow 

Publication date: 29 August 1993

Published in: ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01415994

Recommendations

• scientific article; zbMATH DE number 1383083
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
• scientific article; zbMATH DE number 3902037
• scientific article; zbMATH DE number 494358
• scientific article; zbMATH DE number 757674

zbMATH Keywords

optimizationdecidabilitylocal search algorithms\(NP\)-hard

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Maximal Flow Through a Network
• A new polynomial-time algorithm for linear programming
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Bimatrix Equilibrium Points and Mathematical Programming
• How easy is local search?
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• On the number of iterations of local improvement algorithms
• A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
• The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods

Cited In (5)

• Analyzing the complexity of finding good neighborhood functions for local search algorithms
• An analysis of neighborhood functions on generic solution spaces
• Expected improvement for expensive optimization: a review
• A class of convergent generalized hill climbing algorithms
• Order preserving reductions and polynomial improving paths

This page was built for publication: The effectiveness of finite improvement algorithms for finding global optima

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