scientific article

zbMATH Open1222.65056MaRDI QIDQ3013421

B. K. Nmah

Publication date: 18 July 2011

Title of this publication is not available (Why is that?)

zbMATH Keywords

worst-case computational complexitypolynomially bounded integer programming algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Complexity and performance of numerical algorithms (65Y20)

Related Items (7)

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ Large final polynomials from integer programming ⋮ Title not available (Why is that?) ⋮ Fully Bounded Polyhedral Analysis of Integers with Wrapping ⋮ Title not available (Why is that?) ⋮ A strongly polynomial algorithm for bimodular integer linear programming ⋮ A class of polynomially solvable range constraints for interval analysis without widenings

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An algorithm for solving parametric integer program 👍 👎
• An algebraic algorithm for solving parametric integer programs 👍 👎
• On the optimality of pseudo-polynomial algorithms for integer programming 👍 👎
• Optimization methods for a class of integer polynomial programming problems 👍 👎
• On the Optimality of Pseudo-polynomial Algorithms for Integer Programming 👍 👎
• Integer Polynomial Optimization in Fixed Dimension 👍 👎

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 Q3013421)