Harvey M. Salkin. Integer Programming. Addison-Wesley Publishing Company, 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....method to solve (1) is that the variables ffi i (j) are restricted to be integer numbers, or more specifically 0 and 1. In the context of linear programming, this is called a zero one program. A general integer programming problem as well as a general zero one programming problem is known to be NP [18]. The available techniques to solve a general integer programming problem can be categorized into the following two major groups [18] i) cutting plane techniques, and (ii) enumerative techniques. There is also a fair amount of research on the specific topic of zero one programming. Fortunately, ....

....of linear programming, this is called a zero one program. A general integer programming problem as well as a general zero one programming problem is known to be NP [18] The available techniques to solve a general integer programming problem can be categorized into the following two major groups [18]: i) cutting plane techniques, and (ii) enumerative techniques. There is also a fair amount of research on the specific topic of zero one programming. Fortunately, in the present case, one can substantially reduce the search complexity using the following simple theorem [1] Theorem 1: There are ....

H. M. Salkin, Integer programming, Addison-Wesley Publishing Company, 1975.

....redesigned. 2. RELATED WORK In the last two decades, combinatorial optimization in general, and integer and linear programming in particular, have attracted a great deal of attention. Numerous high quality books appeared including [10, 12] Quality textbooks on integer programming include [11, 14]. ILP has been widely used in CAD for a great variety of optimization tasks, ranging from physical CAD [8] to behavioral synthesis [2] It appears that one of the first e#orts for EC was performed at Hitachi. Shinsha et al. 13] described an incremental logic synthesis technique for supporting ....

H.M. Salkin. Integer programming. Massachusetts: Addison-Wesley, 1975.

.... Programming Formulation The problem of clustering of rules of a KB can now be stated as follows: Minimize CDB CKB C SR Under the constraint m X k=1 x ik = 1 8i; i = 1; n: 13 The problem as formulated is quadratic in nature and it is very difficult to solve efficiently [20]. Since the variables are boolean, the problem can be converted to a 0 1 linear programming problem, as suggested by Watters [24] at the expense of introducing new variables and constraints as shown below. 3.3 Reduction to 0 1 Linear Programming Formulation Substituting y ik i 0 k 0 = x ik ....

H.M. Salkin. Integer Programming. Addison-Wesley Reading, MA, 1979.

....constraints into a problem with a single constraint so that both problems have the same set of feasible solutions. The integration of several constraints into a single constraint is possible, on the other hand the tradeo of this approach is a considerably increased value of the righthand side b [23]. A more ecient way of incorporating multiple constraints into Models I through IV is the introduction of an s dimensional right hand side vector 0 K B, replacing the right hand side k 2 IN 0 in the single constraint model. The corresponding K MCMCKP is accordingly de ned as the MCMCKP with ....

H.M. Salkin. Integer Programming. Addison-Wesley, Reading, Mass., 1975.

....whether bid i is selected or not. We focus this presentation around a set partitioning algorithm introduced by Garfinkel and Nemhauser [Garfinkel and Nemhauser, 1969] For definitions of the set partitioning problem and related problems, cf. Balas and Padberg [Balas and Padberg, 1976] and Salkin [Salkin, 1975]. As pointed out by the originators, the approach is so simple that it appears to be obvious. However, it seems worth reporting because it has performed so well . Indeed, some of the experimental results reported by Garfinkel and Nemhauser seem surprisingly good compared to recent experiments ....

....found so far, this branch of the search can be pruned. Compared to the simple pruning described in the Garfinkel Nemhauser algorithm, Sandholm s algorithm [Sandholm, 1999] and the CASS algorithm [Fujishima et al. 1999] use a more sophisticated technique which essentially is the ceiling test [Salkin, 1975] . 1 At the presentation of CASS at IJCAI 1999 in Stockholm, the CASS algorithm [Fujishima et al. 1999] was reported to outperform Sandholm s winner determination algorithm [Sandholm, 1999] by approximately two orders of magnitude for the distributions tested. 3 Combinatorial auction winner ....

[Article contains additional citation context not shown here]

H. M. Salkin. Integer Programming. Addison Wesley Publishing Company, Reading, Massachusetts, 1975.

....is restricted to 0 1 values, y 2 f0; 1g m , where zero means a unit operation is non existant in a flowsheet, vice versa. In most applications of interest the objective and constraint functions f and g are linear in y. To solve the problem above the branch and bound method (see e.g. [106]) generalized Benders Decomposition [108] Outer Approximation [109, 110] LP NLP branch and bound [111] and Extended Cutting Plane Method [112] are in use. Grossmann and Kravanja [113] give an extensive compilation of literature on MINLP problems. 1. Outlook Only a short glance of the very many ....

Salkin, H.M., 1975, Integer Programming. Addison-Wesley, Reading (MA)

....matrices and vectors, F j and c j are the coefficient matrices and displacement vectors, OE max and OE min are a pair of common bound vectors of the references. The idea behind Definition 2 for the merged image is to introduce p integer variables , x 1 ; x p , between 0 and 1 [15]. Since the sum of them is p Gamma 1, only one variable can be 0 and the remaining variables must be 1. The following theorem shows that if all the convex sets of nested loops are non empty, the merged image is the exact set of the elements accessed by all the references. Theorem 1 If each ....

H. M. Salkin, Integer Programming. Addison-Wesley Publishing Company, 1975.

....by an integer computation of M . The problem of finding an integer solution to C(M; for the unknowns n s 0; m e 0; r e 0 is a classical integer linear programming problem. It is shown in [GJ79] to be NP complete, but algorithms that are efficient for frequently occuring cases are known [Sal75] 5 Real Computations: Single Timer In the previous section, we presented an algorithm for satisfiability of duration properties over the integer computations of an fta. In this and the following section, we deal with satisfiability of duration properties over the entire set of an fta s ....

H.M. Salkin. Integer Programming. Addison-Wesley, 1975.

....occur all over the place. The epistasis measure (e.g. 1] 6] computes the least squares distance between a fitness function and the class of first order functions, whereas the bit decidability metric [6] is based on the concept of independent decidability of loci. Integer Programming (e.g. [11]) requires a first order function to be optimized, under the restriction of a number of linear relations. In Sect. 2.2, we see that the well known problem from statistical physics of finding the ground state of a lattice gas can be modeled into a fitness function maximization problem. There, the ....

Salkin, H.M. (1975): "Integer Programming". Addison--Wesley, Reading, Ma.

....constraints into a problem with a single constraint so that both problems have the same set of feasible solutions. The integration of several constraints into a single constraint is possible, on the other hand the tradeoff of this approach is a considerably increased value of the righthand side b [20]. A more efficient way of incorporating multiple constraints into Models I through IV is the introduction of an s dimensional right hand side vector 0 K B, replacing the right hand side k 2 IN 0 in the single constraint model. The corresponding K MCMCKP is accordingly defined as the MCMCKP with ....

H.M. Salkin. Integer Programming. Addison-Wwesley, Reading, Mass., 1975.

No context found.

Harvey M. Salkin. Integer Programming. Addison-Wesley Publishing Company, 1975.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC