QUBO formulations of the longest path problem
From MaRDI portal
Publication:2658047
DOI10.1016/j.tcs.2021.02.021zbMath1501.90104MaRDI QIDQ2658047
Joey McCollum, Thomas P. Krauss
Publication date: 18 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.021
90C35: Programming involving graphs or networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximating the longest path in a graph
- Pseudo-Boolean optimization
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- Longest path analysis in networks of queues: dynamic scheduling problems
- A new modeling and solution approach for the number partitioning problem
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Faster deterministic parameterized algorithm for \(k\)-path
- Compact quadratizations for pseudo-Boolean functions
- The quantum adiabatic optimization algorithm and local minima
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Color-coding
- Algorithms and Computation