Formulations and algorithms for the simple cycle problem

DOI10.1007/S10589-025-00726-4MaRDI QIDQ6872926zbMATH OpenFDO

Authors Abilio Lucena, L. Simonetti, Alexandre Salles da Cunha

Publication date 19 January 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-025-00726-4

zbMATH Keywords

branch-and-cut algorithmsformulationspolyhedral comparisonssimple cycle problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A branch and cut approach to the cardinality constrained circuit problem.
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A heuristic procedure for the capacitated m-ring-star problem
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
• A note on performance profiles for benchmarking software
• A note on the prize collecting traveling salesman problem
• An algorithm for the longest cycle problem
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem
• Benchmarking optimization software with performance profiles.
• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
• Exact Solution Algorithms for the Chordless Cycle Problem
• Finding minimum dominating cycles in permutation graphs
• scientific article; zbMATH DE number 4125195 (Why is no real title available?)
• scientific article; zbMATH DE number 1517142 (Why is no real title available?)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• Minimum dominating cycles in 2-trees
• Minimum dominating cycles in outerplanar graphs
• On cycle cones and polyhedra
• On the cycle polytope of a directed graph and its relaxations
• Solving the Orienteering Problem through Branch-and-Cut
• Strong lower bounds for the prize collecting Steiner problem in graphs
• The Capacitated m-Ring-Star Problem
• The Circuit Polytope: Facets
• The prize collecting traveling salesman problem
• The prize collecting traveling salesman problem: II. Polyhedral results
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm
• The selective travelling salesman problem
• The Steiner tree polytope and related polyhedra
• The symmetric generalized traveling salesman polytope
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: Formulations and algorithms for the simple cycle problem

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