scientific article; zbMATH DE number 3559281

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items

Solving mixed integer nonlinear programs by outer approximation, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, A theoretical and computational analysis of full strong-branching, The multidimensional 0-1 knapsack problem: an overview., Experiments in mixed-integer linear programming using pseudo-costs, A cascade algorithm for the logical closure of a set of binary relations, The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results, A branch and bound algorithm for solving the multiple-choice knapsack problem