Multicommodity information flow through quantum annealer

DOI10.1007/s11128-024-04518-3MaRDI QIDQ6617048

Munawar Ali, Hasnat Ahmed, Aeysha Khalique, Madiha Hussain Malik

Publication date: 9 October 2024

Published in: Quantum Information Processing (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationquantum computingquantum annealing algorithmorigin-destination integer multi-commodity flow problem

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• The unconstrained binary quadratic programming problem: a survey
• Queueing delay guarantees in bandwidth packing
• Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
• The multi-hour bandwidth packing problem
• Quantum stochastic optimization
• A class of games possessing pure-strategy Nash equilibria
• On the Computational Complexity of Combinatorial Problems
• Bandwidth Packing: A Tabu Search Approach
• An Integer Programming Approach to the Bandwidth Packing Problem
• A penalized best‐response algorithm for nonlinear single‐path routing problems
• A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
• A branch‐and‐price algorithm for the single‐path virtual network embedding problem
• A GRASP with path-relinking for private virtual circuit routing
• Reducibility among Combinatorial Problems
• PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows

This page was built for publication: Multicommodity information flow through quantum annealer