Table of Contents
Fetching ...

Structure-Aware Optimization of Decision Diagrams for Health Guidance via Integer Programming

Nanako Shimaoka, Naoyuki Kamiyama, Shinji Hotta, Sayuri Kohmura, Yuta Kurume, Hiroko Suzuki, Akihiro Inomata, Eigo Segawa

Abstract

In this paper, we consider a structure-aware optimization problem for decision diagrams used for health guidance. In particular, we focus on decision diagrams that decide to whom public sectors suggest consulting a medical worker. Furthermore, these diagrams decide which notification method should be used for each target person. In this paper, we formulate this problem as an integer program. Then we evaluate its practical usefulness through numerical examples.

Structure-Aware Optimization of Decision Diagrams for Health Guidance via Integer Programming

Abstract

In this paper, we consider a structure-aware optimization problem for decision diagrams used for health guidance. In particular, we focus on decision diagrams that decide to whom public sectors suggest consulting a medical worker. Furthermore, these diagrams decide which notification method should be used for each target person. In this paper, we formulate this problem as an integer program. Then we evaluate its practical usefulness through numerical examples.
Paper Structure (10 sections, 5 theorems, 22 equations, 1 figure, 7 tables)

This paper contains 10 sections, 5 theorems, 22 equations, 1 figure, 7 tables.

Key Result

Lemma 1

Assume that we are given a feasible assignment $\phi$ corresponding to $p,q$ satisfying eq:constraint_p_q, and assume that $\alpha,\beta$ satisfy eq:constraint_alpha. Let $t,v$ be an examinee type in $T$ and a vertex in $V \setminus \{r\}$, respectively. Assume that, for every integer $\ell \in \{0,

Figures (1)

  • Figure 1: (a) Instance 1. (b) Instance 2. (c) Instance 3.

Theorems & Definitions (10)

  • Lemma 1
  • proof
  • Lemma 2
  • proof
  • Lemma 3
  • proof
  • Lemma 4
  • proof
  • Lemma 5
  • proof