LLL-solver

MaRDI QIDQ2925058zbMATH OpenFDO

Authors D. M. Murin

Publication date 20 October 2014

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation methods and heuristics in mathematical programming (90C59)

Review text

An approach to solve some variants of the so-called NP-complete problems during an acceptable period of time is considered. The approach is based on the known Lagarias-Odlyzko method for low-density knapsack problems. A notion of algorithm acceptance function is introduced and its application to the considered problems is demonstrated.

Recommendations

• Modification of the Lagarias-Odlyzko method for solving the generalized knapsack problem and the systems of knapsack problems
• Solving low density knapsacks
• Solving low-density subset sum problems
• scientific article; zbMATH DE number 3880121
• An Improved Low-Density Subset Sum Algorithm

Cited in

(1)

• The global solver in the LINDO API

This page was built for publication: LLL-solver

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