Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
a genetic algorithm mimics evolution by natural selection it begins with a set of solutions ie a population and allows
ant colony optimization can be applied to the traveling salesman problem on n cities as followsinitially all the ants
particle swarm optimization can be applied to global optimization as followsthe goal is to search a space of many
consider the constraint set c consisting of the equation x1x2 2x3 and domains xj isin 0 1 2 3 4 5 for j 1 2 3reduce
show by counter examples that a k-consistent constraint set is not necessarily k - 1-consistent and not necessarily k
consider the constraint set c consisting ofx1 x2 x4 gt 1x1 1-x2 x3 gt 1x11-x4gt1with domains xj isin 0 1 for j 1 2
consider the optimization problemmin 2 x1 x2x1 x2 gt 1x1 - x2 gt 0x1x2gt0where each xj is a real number suppose that
recall the constraint-directed branching search of figureat node 6 what is the restricted problem pk1 here k 1exhibit
in the machine scheduling problem of section 237 job 4 is assigned to machine b in iteration k 0 what is the resulting
formulate the following problem using linear disjunctions variable indices and stretch-cycle constraintsthe week is
question 1consider the following situations and indicate whether consideration is present and whether jack has an
a farmer wishes to apply fertilizer to each of several plots the additional crop yield from plot i per unit of type k
describes how to modify an acyclic graph g to obtain a graph g such that finding a shortest path in g finds a shortest
a group of medications are commonly used to treat a form of cancer but they can be taken only in certain combinationsa
find a feasible solution of the cnf expression in exercise 1 using a dpl algorithm with clause learning branch on
exercise 5interpret the solution of the no good set in exercise 5 as the solution of a relaxation for each step k write
write 240 for each release time t1 and each deadline t2 t1 2 in the problem of table 211 verify that 241 are the
a difficulty with the model is that the setup cost after an idle period is always the same regardless of which nondummy
formulate this lot sizing problem using a combination of variable indices linear constraints and stretch constraintsin
formulate the following problem using the appropriate global constraintsthere are six security guards and four
you have been asked to advise an international listed company within the textbook publishing industry on how to improve
formulate the following problem with the help of conditional constraints a lumber operation wishes to build temporary
write the knapsack cuts that correspond to the non-maximal packings i 1 2 3 4 for constraint 23aif a linear
solve the problem of minimizing 3x1 4x2 subject to 2x1 3x2 ge 10 and x1 x2 isin 0 1 2 3 using branch and relax
define a cover for an inequality ax le a0 that is analogous to a packing for ax ge a0what is the knapsack cut