Technical Note—Solving Integer Programming Problems by Aggregating Constraints | Zendy

Kenneth E. Kendall | Zendy; Stanley Zionts | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Solving Integer Programming Problems by Aggregating Constraints

Author(s) -

Kenneth E. Kendall,

Stanley Zionts

Publication year - 1977

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.25.2.346

Subject(s) - integer programming , mathematical optimization , constraint (computer aided design) , integer (computer science) , bounded function , constraint programming , mathematics , work (physics) , computer science , stochastic programming , programming language , mechanical engineering , mathematical analysis , geometry , engineering

Integer programming problems with bounded variables can be solved by combining the constraints into an equivalent single constraint. This note presents a refinement to earlier work that reduces the size of the coefficients in the equivalent constraint and points out advantages as well as computational considerations for solving problems by this method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research