Parametric-objective integer programming using knapsack facets and Gomory cutting planes
A method for solving parametric integer programs is presented. Fixed integer programs are solved using knapsack facets or a cutting plane algorithm and their number is minimized by post-optimal analysis and re- optimization. Computational results are given.
scientific article; zbMATH DE number 4014453
scientific article