𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Aggregation of constraints in integer programming

✍ Scribed by Balasubramanian Ram; Mark H. Karwan; A.J.G. Babu

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
783 KB
Volume
35
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating covering integer programs
Approximating covering integer programs with multiplicity constraints
✍ Stavros G Kolliopoulos πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 176 KB

In a covering integer program (CIP), we seek an n-vector x of nonnegative integers, which minimizes c T β€’ x, subject to Ax ΒΏ b, where all entries of A; b; c are nonnegative. In their most general form, CIPs include also multiplicity constraints of the type x 6 d, i.e., arbitrarily large integers are

The splitting of variables and constrain
The splitting of variables and constraints in the formulation of integer programming models
✍ H.P. Williams; S.C. Brailsford πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 385 KB

The splitting of variables in an integer programming model into the sum of other variables can allow the constraints to be disaggregated, leading to a more constrained (tighter) linear programming relaxation. Well known examples of such reformulations are quoted from the literature. They can be view

A mixed integer programming for robust t
A mixed integer programming for robust truss topology optimization with stress constraints
✍ Yoshihiro Kanno; Xu Guo πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 285 KB

## Abstract This paper presents a mixed integer programming (MIP) formulation for robust topology optimization of trusses subjected to the stress constraints under the uncertain load. A design‐dependent uncertainty model of the external load is proposed for dealing with the variation of truss topol

Constraint Logic Programming and Integer
Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem
✍ Ken Darby-Dowman; James Little; Gautam Mitra; Marco Zaffalon πŸ“‚ Article πŸ“… 1997 πŸ› Springer US 🌐 English βš– 977 KB

Generalised Assignment Problems (GAP), traditionally solved by Integer Programming techniques, are addressed in the light of current Constraint Programming methods. A scheduling application from manufacturing, based on a modified GAP, is used to examine the performance of each technique under a vari