Graph convolutional branch and bound

DOI10.1016/J.EJOR.2026.03.036MaRDI QIDQ7325396zbMATH OpenFDO

Authors Lorenzo Sciandra, Roberto Esposito, Andrea Grosso, Laura Sacerdote, Cristina Zucca

Publication date 7 September 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2026.03.036

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• ``Neural computation of decisions in optimization problems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A method for solving traveling-salesman problems
• An Automatic Method of Solving Discrete Programming Problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An improved branching rule for the symmetric travelling salesman problem
• Estimating the Held-Karp lower bound for the geometric TSP
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Improving the Held and Karp Approach with Constraint Programming
• Learning the travelling salesperson problem requires rethinking generalization
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Mixed integer programming: analyzing 12 years of progress
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• The traveling salesman problem. A computational study.
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: Graph convolutional branch and bound

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