scientific article; zbMATH DE number 3338967

zbMath0213.44801MaRDI QIDQ5615775

M. A. Kronrod, Yefim Dinitz

Publication date: 1969

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

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items

Optimum matchings in weighted bipartite graphs, Parallel-machine scheduling with maintenance: praising the assignment problem, Linear-Time Approximation for Maximum Weight Matching, An algorithm for algebraic assignment problems, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph, Critical objective function values in linear sum assignment problems, A genuinely polynomial primal simplex algorithm for the assignment problem, Maximum weight bipartite matching in matrix multiplication time, An equivalency problem in discrete programming over ordered semigroups, The auction algorithm: A distributed relaxation method for the assignment problem, A statistical correlation technique and a neural network for the motion correspondence problem