In this paper authors propose a methodology for generating good lower bounds on the optimal value of the objective function using a quantum machine.
Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer
Plakat: Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer
Plakat przedstawiony na konferencji: International Conference on Computational Science, która odbyła się w dniach 3-5 lipca 2023 roku w Pradze.
An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine
In the publication authors present a new approach to solving NP-hard discrete optimization problems using D-Wave’s QPU quantum processor architecture implementing quantum annealing.
Anomaly Detection Module for Network Traffic Monitoring in Public Institutions
The publication concerns the increase in network traffic safety based on the continuous monitoring of network traffic statistics and detecting possible anomalies in the network traffic description.
Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem
This work is focused on a new distributed quantum annealing method of algorithm construction for solving an NP-hard scheduling problem.
PRACE annual report
The PRACE 2019 report includes information on the development of local initiatives within the EuroHPC Joint Undertaking, on which PRACE is based. The document also outlines the challenges faced by research entities with high-performance computing infrastructure.