Coefficient reduction for inequalities in 0–1 variables

Publisher Website

1 December 1974

journal article
Published by Springer Nature in Mathematical Programming

Vol. 7 (1), 263-282
https://doi.org/10.1007/bf01585527

Abstract

No abstract available

Keywords

This publication has 10 references indexed in Scilit:

Experiments in the formulation of integer programming problems
Published by Springer Nature ,1974
An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach
Operations Research, 1973
Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
Naval Research Logistics Quarterly, 1972
Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
Operations Research, 1971
Extensions of the Group Theoretic Approach in Integer Programming
Management Science, 1971
Transformation of integer programs to knapsack problems
Discrete Mathematics, 1971
Equivalent Integer Programs and Canonical Problems
Management Science, 1971
An Enumeration Algorithm for Knapsack Problems
Operations Research, 1970
Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects
Management Science, 1967
ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
Proceedings of the National Academy of Sciences, 1965

Cited by 46 articles