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 ...

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 ...

This repository contains comprehensive implementations of algorithms from the classic textbook "Fundamentals of Computer Algorithms" (Second Edition) by Ellis Horowitz, Sartaj Sahni, and Sanguthevar ...

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 ...

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 ...

The Dynamic Vehicle Routing Problem with Stochastic Requests (DVRPSR) is a prototypical problem in transportation logistics. The DVRPSR calls for an initial route plan and an online scheduling policy ...