Integer Programming by Group Theory: Some Computational Results

Abstract

A group theoretic algorithm for the integer program has been computer programmed and tested. It basically consists of a linear programming algorithm, a routine which converts the (relaxed) integer program to a group minimization problem (over the fractional column group or the isomorphic factor group attained via Smith's Normal Form), solving the group problem by dynamic programming or by a shortest path algorithm, and when necessary, uses a branch and bound procedure. Details and computational results are given. Future work regarding other computational strategies available to group theoretic algorithms is also included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1975
Accession Number
ADA005002

Entities

People

  • Harvey M. Salkin
  • Susumu Morito

Organizations

  • Case Western Reserve University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Dynamic Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Mathematical Programming
  • New York
  • Notation
  • Operations Research
  • Optimization
  • Simplex Method

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computer Science.
  • Mathematical Modeling and Probability Theory.