Reducing the number of variables in integer and linear programming problems

DOI10.1007/BF01300969zbMath0802.90079MaRDI QIDQ1326508

Sahib S. Mardanov, Djangir A. Babayev

Publication date: 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

large scale knapsack problems

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05)

Related Items (6)

On dominated terms in the general knapsack problem ⋮ Progress in presolving for mixed integer programming ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG ⋮ Reducing the number of variables in integer quadratic programming problem ⋮ Unbounded knapsack problem: Dynamic programming revisited ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem

Cites Work

• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing the number of variables in integer and linear programming problems