scientific article; zbMATH DE number 3559281

zbMATH Open0358.90038MaRDI QIDQ4132250FDOQ4132250

Raymond Breu, C. A. Burdet

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited In (9)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132250)