Constraint Pairing In Integer Programming

DOI10.1080/03155986.1975.11731594MaRDI QIDQ4058478zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer, Manfred Padberg, Uri N. Peled

Publication date 1975

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1975.11731594

Mathematics Subject Classification ID

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

Cited in

(6)

• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• Minimization of Akaike's information criterion in linear regression analysis via mixed integer nonlinear program
• The quadratic knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

This page was built for publication: Constraint Pairing In Integer Programming

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