scientific article

zbMath0462.68009MaRDI QIDQ3912008

Bernhard Korte, Rainer Schrader

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationfixed point theorycombinatorial optimizationnonlinear optimizationindependence systemsoracle techniquesoracle algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Convex programming (90C25) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Related Items

On different approximation criteria for subset product problems, The computational complexity of antimatroid properties, A class of generalized greedy algorithms for the multi-knapsack problem, A fully polynomial approximation scheme for the total tardiness problem, Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses, Completeness in approximation classes