The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The multiple knapsack problem(MKP) is a classified NP-hard optimization problem, which is a generalization of the simple knapsack problem (KP). Hence algorithms for finding the exact solution of MKP are not suitable for application in real-time decision-making applications. This paper presents a competitive decision algorithm (CDA) for MKP. CDA is newly proposed meta-heuristic algorithm for solving...
The multiple-choice knapsack problem (MCKP) is a classified NP-hard optimization problem, which is a generalization of the simple knapsack problem (KP). Hence algorithms for finding the exact solution of MCKP are not suitable for application in real-time decision-making applications. This paper presents a competitive decision algorithm (CDA) for MCKP. CDA is newly proposed meta-heuristic algorithm...
The multidimensional knapsack problem (MKP) is a classified NP-hard optimization problem, which is a generalisation of the 0-1 simple knapsack problem (KP). It consists in selecting a subset of given items in such a way that the total profit of the selected items is maximized while a set of knapsack constraints are satisfied.The MKP is resource allocation model that is one of the most well-known integer...
The minimum spanning tree(MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component which is a classic problem in operational research(OR) with important applications in a number of applications, both as a stand-alone problem and as a subproblem in a more complex. The problem considered here is that of determining whether a given spanning tree of a graph...
The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component which is a classic problem in operational research (OR) with important applications in network design. The degree-constrained minimum spanning tree (DCMST) is a special case of MST, which is also an important problem in network design. It consists of finding a spanning tree...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.