go-v.orgdoi

Modified Balanced Assignment Problem in Vector Case

友作 嘉村, Yuusaku Kamura · Institutional Repositories DataBase (IRDB) · 2019

  • DOI 10.34340/00000023
  • Publisher National Institute of Informatics
  • Type article
  • Issued 2019

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Institutional Repositories DataBase (IRDB) · National Institute of Informatics · article · 2019

Abstract

We consider a combinatorial problem that arises from systems' construction.Each system consists of many components, and every component has its own error expressed in a vector.It is required to make the combination that minimizes as small as possible the difference between the maximum error and the minimum one.It means the vector case's balanced optimization problem.In this paper, we deal with the case that each system consists of 2 components and the vector dimension is 3.We apply the approximation algorithm that we have presented for 2-dimensional case to 3-dimensional problem and we show the numerical experiments.

Open the resolved locator · 10.34340/00000023

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 18:36 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://tou.repo.nii.ac.jp/records/31
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.