Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710067zbMATH OpenOpenAlexFDO

Authors Henk Bekker, E. P. Braad, Boris 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)

Recommendations

• Parallel computation of real solving bivariate polynomial systems by zero-matching method
• On solving systems of bivariate polynomials
• Roots of bivariate polynomial systems via determinantal representations
• RESOLUTION OF MULTIPLE ROOTS OF NONLINEAR POLYNOMIAL SYSTEMS
• Algorithms and programs for calculating the roots of polynomial of one or two variables

Cited in

(6)

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

This page was built for publication: Experimental and Efficient Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710067)