A note on reducing the number of variables in integer programming problems

DOI10.1023/A:1008675522511zbMath0898.90096OpenAlexW1541075095MaRDI QIDQ1369365

Nan Zhu, Kevin A. Broughan

Publication date: 20 October 1997

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

Full work available at URL: https://doi.org/10.1023/a:1008675522511

zbMATH Keywords

integer programminginteger variablesknapsack problemsidentification of dominated columns

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

Progress in presolving for mixed integer programming ⋮ Reducing the number of variables in integer quadratic programming problem ⋮ A variable-grouping based genetic algorithm for large-scale integer programming ⋮ An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem ⋮ Excess information in parametric linear optimization

This page was built for publication: A note on reducing the number of variables in integer programming problems