QUBO formulations of the longest path problem
From MaRDI portal
Publication:2658047
DOI10.1016/J.TCS.2021.02.021zbMATH Open1501.90104OpenAlexW3126271729MaRDI QIDQ2658047FDOQ2658047
Authors: 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
Recommendations
- QUBO formulations for the graph isomorphism problem and related problems
- The bipartite QUBO
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Introduction to QUBO
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Color-coding
- Algorithms and Computation
- On approximating the longest path in a graph
- Pseudo-Boolean optimization
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- The quantum adiabatic optimization algorithm and local minima
- Title not available (Why is that?)
- A new modeling and solution approach for the number partitioning problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Longest path analysis in networks of queues: dynamic scheduling problems
- Compact quadratizations for pseudo-Boolean functions
- Faster deterministic parameterized algorithm for \(k\)-path
Cited In (1)
This page was built for publication: QUBO formulations of the longest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658047)
