Journal of the Operations Research Society of Japan
Online ISSN : 2188-8299
Print ISSN : 0453-4514
ISSN-L : 0453-4514
Volume 63, Issue 2
Displaying 1-2 of 2 articles from this issue
  • Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara
    2020 Volume 63 Issue 2 Pages 41-59
    Published: April 30, 2020
    Released on J-STAGE: May 01, 2020

    The submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible solutions for many instances while guaranteeing (1−1/e)-approximation ratio, we still encounter many real applications that ask optimal or better solutions within reasonable computation time. In this paper, we present an efficient branch-and-cut algorithm for the non-decreasing submodular function maximization problem based on its binary integer programming (BIP) formulation with an exponential number of constraints. Nemhauser and Wolsey developed an exact algorithm called the constraint generation algorithm that starts from a reduced BIP problem with a small subset of constraints and repeats solving a reduced BIP problem while adding a new constraint at each iteration. However, their algorithm is still computationally expensive due to many reduced BIP problems to be solved. To overcome this, we propose an improved constraint generation algorithm to add a promising set of constraints at each iteration. We incorporate it into a branch-and-cut algorithm to attain good upper bounds while solving a smaller number of reduced BIP problems. According to computational results for well-known benchmark instances, our algorithm achieves better performance than the state-of-the-art exact algorithms.

    Download PDF (300K)
  • Masamune Kawasaki, Kenjiro Takazawa
    2020 Volume 63 Issue 2 Pages 60-70
    Published: April 30, 2020
    Released on J-STAGE: May 01, 2020

    The clustered traveling salesman problem (CTSP) is a generalization of the traveling salesman problem (TSP) in which the set of cities is divided into clusters and the salesman must consecutively visit the cities of each cluster. It is well known that TSP is NP-hard, and hence CTSP is NP-hard as well. Guttmann-Beck et al. (2000) designed approximation algorithms for several variants of CTSP by decomposing it into subproblems including the traveling salesman path problem (TSPP). In this paper, we improve approximation ratios by applying a recent improved approximation algorithm for TSPP by Zenklusen (2019).

    Download PDF (197K)