scientific article; zbMATH DE number 2086933

MaRDI QIDQ4737538zbMATH OpenFDO

Authors Karen Aardal, Arjen K. Lenstra

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370350.htm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Hard Equality Constrained Integer Knapsacks
• Testing integer knapsacks for feasibility
• An Algorithm for the 0-1 Equality Knapsack Problem
• scientific article; zbMATH DE number 3876925
• A hard knapsack problem

Cited in

(14)

• An improved partial enumeration algorithm for integer programming problems
• Testing integer knapsacks for feasibility
• The many aspects of counting lattice points in polytopes
• A computational study of integer programming algorithms based on Barvinok's rational functions
• Effective lattice point counting in rational convex polytopes
• A two-stage stochastic integer programming approach to integrated staffing and scheduling with application to nurse management
• Inferring Peptide Composition from Molecular Formulas
• Hard Equality Constrained Integer Knapsacks
• Expected Frobenius numbers
• Dimension results for extremal-generic polynomial systems over complete toric varieties
• Fast evaluation of generalized Todd polynomials: applications to MacMahon's partition analysis and integer programming
• Integer-programming software systems
• A partial enumeration algorithm for pure nonlinear integer programming
• A generalization of the integer linear infeasibility problem

This page was built for publication:

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