Investigating Round-Up Properties for the Length-Constrained Cycle Partition Problem

Kilian Runnwerth, Mohammed Ghannam () and Ambros Gleixner
Additional contact information
Kilian Runnwerth: HTW Berlin
Mohammed Ghannam: Zuse Institute Berlin
Ambros Gleixner: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2024, 2025, pp 193-198 from Springer

Abstract: Abstract The length-constrained cycle partition problem (LCCP) is a graph optimization problem where the goal is to partition the set of nodes into as few cycles as possible. Each node is linked to a critical time and the length of a cycle must not exceed the critical time of any node in the cycle. We formulate the LCCP as a set partitioning problem, which can be solved to global optimality by branch and price. On standard benchmark instances from the literature, this formulation consistently satisfies the integer round-up property (IRUP), i.e., the objective value of the root node relaxation rounded up is equal to the optimal objective value. In this paper we construct counterexamples with small coefficients for which the set partitioning formulation of LCCP does not have IRUP, and provide some simple conditions under which IRUP holds. Our computational tests reveal that 30 out of 51 standard test instances with IRUP can be explained by these conditions.

Keywords: Branch-and-Price; Round-up Properties; Cycle Partitioning (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-92575-7_27

Ordering information: This item can be ordered from
http://www.springer.com/9783031925757

DOI: 10.1007/978-3-031-92575-7_27

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().