TermiNet: a reinforcement learning framework for k-path partitioning problem

DOI10.1016/J.AMC.2026.130090MaRDI QIDQ7324983zbMATH OpenFDO

Authors Linghui Ba, Sihao Liu, Guohui Lin, Weihua He

Publication date 4 September 2026

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2026.130090

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Mathematical programming (90Cxx)

Cites work

• \(k\)-path partitions in trees
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A local search 4/3-approximation algorithm for the minimum 3-path partition problem
• A local search algorithm for the k-path partition problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An improved approximation algorithm for the minimum 3-path partition problem
• Approximation algorithms for the directed path partition problems
• Computer Solutions of the Traveling Salesman Problem
• Directed path partition problem on directed acyclic graphs
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Improved approximation algorithms for the \(k\)-path partition problem
• Learning representations by back-propagating errors
• Learning the travelling salesperson problem requires rethinking generalization
• On the \(k\)-path partition of graphs.
• Structured learning with constrained conditional models
• The path partition problem and related problems in bipartite graphs
• The vehicle routing problem: An overview of exact and approximate algorithms

This page was built for publication: TermiNet: a reinforcement learning framework for \(k\)-path partitioning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7324983)