hester A 1 2 3 4 5 Question #4 Multiple Choice A shipping company wants to use an algorithm to calculate the cheapest shipping route for a set of deliveries that minimizes shipping weight and delivers the packages on the fastest possible route. For 20 item deliveries, there are millions of combinations, causing the algorithm to require too many steps to compute in a reasonable amount of time. This algorithm is an example of which type of problem? O simple problem intractable problem O tractable problem O polynomial time problem Copyright © by Edgenuity Section 5 of 5 SAVE SURMIT

hester A 1 2 3 4 5 Question #4 Multiple Choice A shipping company wants to use an algorithm to calculate the cheapest shipping route for a set of deliveries that minimizes shipping weight and delivers the packages on the fastest possible route. For 20 item deliveries, there are millions of combinations, causing the algorithm to require too many steps to compute in a reasonable amount of time. This algorithm is an example of which type of problem? O simple problem intractable problem O tractable problem O polynomial time problem Copyright © by Edgenuity Section 5 of 5 SAVE SURMIT

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.9: Finite Source Models: The Machine Repair Model

Problem 4P

See similar textbooks

Similar questions

As of early 2022, the global bitcoin hashrate is 160∗1018 hashes per second. The Antminer S19 can compute 110 TH/s = 110∗1012 hashes per second. It costs $2600 and consumes 3.25kW when operating. Question: Assuming that BTC is worth $40,000, the mining reward is 6.25 BTC, and that electricity costs 10 cents per kilowatt hour, how long would a miner who bought the devices calculated in Question 14 above achieve a 1% market share need to operate in order to break even? For simplicity, assume that the BTC price and hash difficulty do not change.
Q2: There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initially empty. Using these three buckets, we can perform any number of the following two types of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water and pour it into the size-M bucket, as long as this will not cause the size-M bucket to overflow. Although we may not be able to completely fill the size-M bucket, but we can still determine the maximum amount of milk we can possibly add to largest bucket. Sample input: 17 25 77 Sample output: 76 In this example, we fill the bucket of size 17 three times and then bucket of size 25 once, accumulating a total of 76 units of water. You could use additional test case to test your program: Input: 52 791 877 Output: 843 Input: 26…
Wireless sensor networks are a special kind of network that facilitates communication. Sensor nodes in WSNs relay information to and from a central base station. The computing resources and storage space of a sensor node are limited. Take, for example, an algorithm that can be solved by solving subproblems. Is it preferable to use dynamic programming or divide and conquer to solve these subproblems independently at various sensor nodes? Try to keep your writing short and sweet.
Select an intelligent optimization method (such as tabu search, simulated annealing, genetic algorithm, ant colony optimization, particle swarm optimization, or other methods) and using programming language to implement it to solve a traveling salesman problem or a functional optimization problem.(For TSPs, you can choose any TSP problem from https ://people.sc.fsu.edu/ jburkardt/datasets/tsp/tsp.html to solve, but I suggest a median scale is OK, such as FRI26 with 26 cities. For function optimization, search the minimal value of f(x), and f(x) = −∑n i=1 sin(xi)(sin(ix2 i /π)) 2m, where n = 10,m = 10, subject to 0 < xi < π,i = 1,...,n. There are n! local optima and the global minimum value for n = 10 is f(x∗) = −9.660152. ) please give me python program code..thanks
Suppose that you want to schedule some final exams for CS courses with following course numbers: 555, 137, 157, 203, 261, 115, 118, 156. Suppose also that there are no students in common taking the following pairs of courses: 555‐137, 555‐157, 137‐157, 555‐203, 555‐261, 137‐261, 203‐261, 555‐115, 137‐115, 203‐115, 261‐115, 555‐118, 137‐118, 555‐156, 137‐156, 157‐156. Schedule the exam using the fewest number of slots. [Hint: Start your answer with graph sketching]
What is the effect of including spelling errors, vs. automatically correcting spelling errors on Heaps’ law?Compute the vocabulary size M for this scenario:  Looking at a collection of web pages, you find that there are 3000 different terms in the first 10,000 tokens and 30,000 different terms in the first 1,000,000 tokens.  Assume a search engine indexes a total of 20,000,000,000 (2 × 1010) pages, containing 200 tokens on average  What is the size of the vocabulary of the indexed collection as predicted by Heaps’ law?
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. every cell of the network contains a non-negative integer. Each turn, a player should play out every one of the accompanying activities all together. Pick a beginning cell (r1,c1) with non-zero worth. Pick a completing cell (r2,c2) to such an extent that r1≤r2 and c1≤c2. Lessening the worth of the beginning cell by some sure non-zero integer. Pick any of the most limited ways between the two cells and either increment, lessening or leave the upsides of cells on this way unaltered. Note that: a most limited way is one that goes through the most un-number of cells; all cells on this way barring the beginning cell, yet the completing cell might be altered; the subsequent worth of every cell should be a non-negative integer; the cells are changed freely and not really by a similar worth. On the off chance that the beginning and finishing cells are something very…
NOTE: Answer is required in Java EclipseSuppose a business person launches new cinema at Islamabad and ask his team to develop a ticket system for box office. He assigns some requirements about system that how should it work. The requirements are such a way that there are only '5' number of box office windows in the theatre. Each window can have at max '20' number of people waiting in line. To start with, only one window is opened. If the number of people waiting in line in that window exceeds 20, then the next window is opened and people can join the line in that window. Likewise, if both the first and second windows have n number of people waiting in each queue, then a third window is opened. This can go on until the maximum number of windows w is reached. Let us assume that once a window is opened it never closes. A new window is only opened if all open windows are full. Each person can buy only one ticket. So, the system should not allot more than one ticket per person. Let us…
Consider a set of movies M1, M2, ... , Mk. There is a set of customers, each one of which indicates the two movies they would like to see this weekend. Movies are shown on Saturday evening and Sunday evening. Multiple movies may be screened at the same time. You must decide which movies should be televised on Saturday and which on Sunday, so that every customer gets to see the two movies they desire. Is there a schedule where each movie is shown at most once? Design an efficient algorithm to find such a schedule if one exists.
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 then the output is: 3 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: No solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy.
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution Assume the two input equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy.
Numerous engineering and scientific applications require finding solutions to a set of equations. Ex: 8x + 7y = 38 and 3x - 5y = -1 have a solution x = 3, y = 2. Given integer coefficients of two linear equations with variables x and y, use brute force to find an integer solution for x and y in the range -10 to 10. Ex: If the input is: 8 7 38 3 -5 -1 Then the output is: x = 3 , y = 2 Use this brute force approach: For every value of x from -10 to 10 For every value of y from -10 to 10 Check if the current x and y satisfy both equations. If so, output the solution, and finish. Ex: If no solution is found, output: There is no solution You can assume the two equations have no more than one solution. Note: Elegant mathematical techniques exist to solve such linear equations. However, for other kinds of equations or situations, brute force can be handy. ''' Read in first equation, ax + by = c '''a = int(input())b = int(input())c = int(input()) ''' Read in second equation, dx + ey = f '''d…