Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
lagrangian relaxation in multidimensional assignment apply the lagrangian relaxation method to the multidimensional
enforced separation in 3-dimensional assignment consider the 3-dimensional assignment problem of example 107 that
this exercise shows that non differentiabilities of the dual function given in section 103 often tend to arise at the
rollout algorithm for the quiz problem consider the quiz problem of exercise 1028 for the case where the maximum number
the quiz problem consider a quiz contest where a person is given a list of n questions and can answer these questions
hardys theoremnbspnbspbe monotonically nondecreasing sequences of numbers let us associate with each i 1n a distinct
a busy professor has to complete n projects each project i has a deadline di and the time it takes the professor to
weighted shortest processing time first rule we want to schedule n tasks the ith of which requires ti time units let ti
scheduling and the interchange argument in some scheduling problems it is useful to try to characterize a globally
scheduling problems viewed as assignment problems a machine can be used to perform a subset of n given tasks over t
rollout algorithms based on greedy algorithms in the context of the rollout algorithm suppose that given a partial
simulated annealing in the context of simulated annealing assume that t is kept constant and let pxy be the probability
shortest paths and branch-and-bound consider a general integer-constrained problem of the formwhere x is some set
solution of the directed chinese postman problem consider expanding the graph of the directed chinese postman problem
given a chinese postman problem delete all nodes of even degree together with all their incident arcs find a perfect
network formulation of nonbipartite matching consider the nonbipartite matching problem of example 104 replace each
consider the kumlonigsberg bridge problem cf fig 106a suppose that there existed a second bridge connecting the islands
steiner tree problem heuristic we are given a connected graph g with a nonnegative weight aij for each arc i j isin a
degree-constrained minimum weight spanning trees consider the minimum weight spanning tree problem subject to the
k-traveling salesmen problem consider the version of the traveling salesman problem where there are k salesmen that
christofides traveling salesman heuristic consider a symmetric traveling salesman problem where the arc costs are
traveling salesman problemtriangle inequality consider a symmetric traveling salesman problem where the arc costs are
consider the problem of finding a shortest forward path in a graph with given arc lengths subject to the constraint
consider the problem of finding a shortest forward path from an origin node s to a destination node t of a graph with