KLI

整數計劃法의 응용문제와 응용문제들의 相互關聯性

Metadata Downloads
Alternative Title
Integer Programming Applications and Their Relationship
Abstract
整數計劃法은 線型計劃法의 특수한 형태로서 여러 분야에서 응용, 연구되고 있으며 이에 따라 여러가지 방법으로 解法이 硏究되고 있다.

본 논문에서는 整數計劃法의 응용분야인 할당문제, 배낭문제, 빈패킹문제, 수송문제, 설비입지선정문제의 整數計劃模型들과 模型들의 의미 그리고 각종 模型들의 연관성에 대하여 연구하고 여러방법으로 행해지고 있는 이들 모형들의 解法에 관하여 살펴보았다.
In this paper, a number of Integer Programming applications are presented. These applications include assignment problems, knapsack problems, bin-packing problems, and special class of transportation problems, facility location problems.

In the first part of the paper, Integer Programming formulations, and their relationship are discussed. In the second part of the paper, various algorithms which are studied for above mentioned five problems are addressed.
In this paper, a number of Integer Programming applications are presented. These applications include assignment problems, knapsack problems, bin-packing problems, and special class of transportation problems, facility location problems.

In the first part of the paper, Integer Programming formulations, and their relationship are discussed. In the second part of the paper, various algorithms which are studied for above mentioned five problems are addressed.
Author(s)
이영덕
Issued Date
1986
Type
Research Laboratory
URI
https://oak.ulsan.ac.kr/handle/2021.oak/4751
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002024747
Alternative Author(s)
Lee, Young-Duk
Publisher
연구논문집
Language
kor
Rights
울산대학교 저작물은 저작권에 의해 보호받습니다.
Citation Volume
17
Citation Number
1
Citation Start Page
237
Citation End Page
247
Appears in Collections:
Research Laboratory > University of Ulsan Report
Authorize & License
  • Authorize공개
Files in This Item:

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.