An improved method for a set-pair routing problem by SAT

A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by routing is flexible. The problem requires routing in which the longest routing length and the length difference are minimum The set-pair routing appears partially in a printed circuit board (PCB). This paper presents an improved routing method for a set-pair routing problem using the SAT solver.

Authors

Kunihiro Fujiyoshi
Koki Nagakura

Institutions

Tokyo University of Agriculture and Technology (JP)

Publication Details

Published: 2024-11-07
DOI: https://doi.org/10.1109/apccas62602.2024.10808676
Primary Topic: Vehicle Routing Optimization Methods
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

An improved method for a set-pair routing problem by SAT

Kunihiro Fujiyoshi, Koki Nagakura

Nov 7, 2024

Vehicle Routing Optimization Methods

article

An improved method for a set-pair routing problem by SAT

Kunihiro Fujiyoshi, Koki Nagakura

November 7, 2024article en

Abstract

Tokyo University of Agriculture and Technology (JP)

Openalex Percentile: Top 64%

Vehicle Routing Optimization Methods

DOI Source OpenAlex

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.

An improved method for a set-pair routing problem by SAT — Kunihiro Fujiyoshi, Koki Nagakura · (2024) | TGRS Research Map | TGRS