Complexity and Exact Solution of Set-Pair Routing Problem

This paper focuses on the set-pair routing problem. The contributions of this paper are as follows: 1) proving the NP-hardness of the set-pair routing problem; and 2) presenting an Integer Linear Programming (ILP) formulation addressing the set-pair routing problem. The proposed method outputs the optimal solution for the benchmarks within the practical run-time.

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2025-09-21
DOI
https://doi.org/10.1587/transfun.2025vlp0001
Primary Topic
Chemical and Physical Properties in Aqueous Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Complexity and Exact Solution of Set-Pair Routing Problem

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Chemical and Physical Properties in Aqueous Solutions
article

Complexity and Exact Solution of Set-Pair Routing Problem

article en

Abstract

This paper focuses on the set-pair routing problem. The contributions of this paper are as follows: 1) proving the NP-hardness of the set-pair routing problem; and 2) presenting an Integer Linear Programming (ILP) formulation addressing the set-pair routing problem. The proposed method outputs the optimal solution for the benchmarks within the practical run-time.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E109.A(3)
The University of Kitakyushu (JP)
Openalex Percentile: Top 50%
Chemical and Physical Properties in Aqueous Solutions
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Complexity and Exact Solution of Set-Pair Routing Problem · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences (2025) | TGRS Research Map | TGRS