scientific article; zbMATH DE number 194516

zbMath0703.90058MaRDI QIDQ4692473

Michail M. Kovalev

Publication date: 5 June 1993

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

zbMATH Keywords

performance analysistravelling salesmanapproximation algorithmsknapsackworst- case analysismethod of partial ordersbicoordinate ascent algorithmconvexity on a partially ordered setgeneralized supermatroid

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convexity of real functions of several variables, generalizations (26B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Maximizing traveling salesman problem for special matrices ⋮ Algorithms to construct a mathematical model of preferences using expert judgments ⋮ An estimate for the curvature of an order-convex set in the integer lattice and related questions ⋮ Unnamed Item ⋮ A polynomial algorithm for resourse allocation problems with polymatroid constrains¹ ⋮ Approximate algorithms for the traveling salesman problem. II ⋮ A Greedy Algorithm for Capacitated Lot-Sizing Problems ⋮ Greedy sets and related problems ⋮ An algorithm for constructing reduced DNFs of order-convex Boolean functions ⋮ Parametric properties of the transportation problem and relations to supermatroids

This page was built for publication: