scientific article; zbMATH DE number 833409

MaRDI QIDQ4859954zbMATH OpenFDO

Authors Carlos E. Ferreira

Publication date 14 January 1996

zbMATH Keywords

branch and cut algorithmscomputer designfacet-defining inequalitiesmulticut problem on hypergraphsmultiple knapsack problempolytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mathematical problems of computer architecture (68M07) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Solving Multiple Knapsack Problems by Cutting Planes
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
• A branch-and-bound algorithm for hard multiple knapsack problems
• A polyhedral approach to an integer multicommodity flow problem
• Polyhedral approaches

Cited in

(8)

• The complexity of cover inequality separation
• Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
• scientific article; zbMATH DE number 5887079 (Why is no real title available?)
• System Completion Problem: Theory and Applications
• Solving Multiple Knapsack Problems by Cutting Planes
• Two-set inequalities for the binary knapsack polyhedra
• Computational aspects of lifted cover inequalities for knapsacks with few different weights
• Knapsack polytopes: a survey

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 Q4859954)