Multicommodity information flow through quantum annealer
From MaRDI portal
Cites work
- A branch-and-price algorithm for the single-path virtual network embedding problem
- A class of games possessing pure-strategy Nash equilibria
- A GRASP with path-relinking for private virtual circuit routing
- A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
- A penalized best-response algorithm for nonlinear single-path routing problems
- An Integer Programming Approach to the Bandwidth Packing Problem
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- Bandwidth Packing: A Tabu Search Approach
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- On the Computational Complexity of Combinatorial Problems
- Optimization by simulated annealing
- PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- Quantum stochastic optimization
- Queueing delay guarantees in bandwidth packing
- Reducibility among combinatorial problems
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- The multi-hour bandwidth packing problem
- The unconstrained binary quadratic programming problem: a survey
This page was built for publication: Multicommodity information flow through quantum annealer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617048)
