Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Optimal Foraging
Area Computation by the Alternative Coordinate Method
Linear Approximation in Time Domain
Pharmacokinetic Models: Comparison and Selection Criterion
Ampere-Maxwell's Law: Problem-Solving
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: Jul 18, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Wenyang Qian1,2, Robert A M Basili3, Mary Mehrnoosh Eshaghian-Wilner4
1Instituto Galego de Fisica de Altas Enerxias (IGFAE), Universidade de Santiago de Compostela, E-15782 Santiago de Compostela, Spain.
This study explores the traveling salesman problem (TSP) using the quantum approximate optimization algorithm (QAOA) on quantum simulators. A balanced QAOA mixer design shows promise for solving complex optimization problems on quantum computers.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: