An Approach for Solving the 0-1 Integer Programming Problem

DOI

Bibliographic Information

Other Title
  • 0-1整数計画問題の準最適化解法

Description

This paper presents an algorithm for finding the solution with the accuracy required on the 0-1 integer programming problem. In this algorithm, an upper bound which is smaller than the optimal value of the correspoding continuous problem is employed to estimate the accuracy of the solution, and the problem size is reduced to search the solution effectively. The properties of the algorithm are discussed using the results of several numerical experiments.

Journal

Details 詳細情報について

  • CRID
    1390282763075871360
  • NII Article ID
    110003949133
  • DOI
    10.11221/jimapre.32.1_71
  • ISSN
    24329983
    03864812
  • Text Lang
    ja
  • Data Source
    • JaLC
    • CiNii Articles
  • Abstract License Flag
    Disallowed

Report a problem

Back to top