The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Department of Engineering Technology, Savannah State University, Savannah, GA, USA. Our analysis reveals that most claimed applications of Grover’s algorithm fall into one of several categories: Those ...

Abstract: We are given a set of items, and a set of knapsacks. Both the weight and the profit of an item are functions of the knapsack, and each knapsack has a positive real capacity. A restriction is ...

One of the key applications of near-term quantum computers has been the development of quantum optimization algorithms. However, these algorithms have largely been focused on qubit-based technologies.

Big O - upper bound Big Omega - lower bound Big Theta - upper and lower bound - that's what's usually used but called Big O. An ArrayList is implemented with an array. When the array hits capacity, ...

In the last decade, public and industrial research funding has moved quantum computing from the early promises of Shor’s algorithm through experiments to the era of noisy intermediate scale quantum ...

Simulated annealing (SA) attracts more attention among classical heuristic algorithms because many combinatorial optimization problems can be easily recast as the ground state search problem of the ...

Two-dimensional (2D) irregular packing problems are widespread in manufacturing industries such as shipbuilding, metalworking, automotive production, aerospace, clothing and furniture manufacturing.

This paper presents a continuous method for solving binary quadratic programming problems. First, the original problem is converted into an equivalent continuous optimization problem by using NCP ...

Abstract: Rapid uptake of distributed energy resources (DER) requires a new market platform for their active participation to manage energy balance locally. This paper proposes a new Peer to Peer (P2P ...