A Cut Approach to a Class of Quadratic Integer Programming Problems.

Abstract

This paper presents an efficient algorithm for solving a class of quadratic integer programming problems. These problems include discrete versions of the quadratic placement problem and the squared Euclidean distance problem. The algorithm solves a finite sequence of minimum cut problems, or equivalently maximum flow problems, on a graph with n + 2 vertices where n is the number of variables in the problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1978
Accession Number
ADA050924

Entities

People

  • H. Donald Ratliff
  • Jean-claude Picard

Organizations

  • University of Florida

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Coefficients
  • Engineering
  • Industrial Engineering
  • Integer Programming
  • Iterations
  • Military Research
  • Sequences
  • Systems Engineering
  • Two Dimensional
  • Universities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.