Integer programming in an algebraic computation model

MaRDI QIDQ5442300zbMATH OpenFDO

Authors Valentin E. Brimkov, Stephan Stoyanov Danchev

Publication date 22 February 2008

zbMATH Keywords

knapsack problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1759478
• Tight complexity lower bounds for integer linear programming with few constraints
• scientific article; zbMATH DE number 3959128
• Lower time bounds for integer programming with two variables
• Fast integer programming in fixed dimension

Cited in

(8)

• An algorithm that is polynomial on the average in integer linear programming
• scientific article; zbMATH DE number 1273691 (Why is no real title available?)
• scientific article; zbMATH DE number 1759478 (Why is no real title available?)
• The computational complexity of integer programming with alternations
• The computational complexity of integer programming with alternations
• scientific article; zbMATH DE number 5679823 (Why is no real title available?)
• Revisiting integer program: complexity, arithmetic, basic variables, and scope
• Integer programming models for the q-mode problem

This page was built for publication: Integer programming in an algebraic computation model

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