Experimental and Efficient Algorithms

DOI10.1007/b136461zbMath1121.90402OpenAlexW2485841483MaRDI QIDQ5710067

E. P. Braad, Henk Bekker, Boris I. Goldengorin

Publication date: 30 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationsolving polynomial equationstolerance based bipartite matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ⋮ Extending single tolerances to set tolerances ⋮ Efficient computation of tolerances in the weighted independent set problem for trees ⋮ Parallel computation of real solving bivariate polynomial systems by zero-matching method ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Local search heuristics for the multidimensional assignment problem