scientific article
From MaRDI portal
Publication:3953561
zbMath0491.90065MaRDI QIDQ3953561
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmcomputational complexitycombinatorial optimizationalgebraic sigma-k assignment problemcost coefficients in ordered semiringssigma-k objective function
Related Items (7)
Solving the \(k\)-cardinality assignment problem by transformation ⋮ Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking ⋮ Assignment problems: a golden anniversary survey ⋮ On \(k\)-sum optimization ⋮ k-sum optimization problems ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ The partial sum criterion for Steiner trees in graphs and shortest paths
This page was built for publication:
