AN APROXIMATE CUT FOR A CLASS OF PROBLEMS OF ENTIRE QUADRATIC PROGRAMATION
DOI:
https://doi.org/10.15381/pes.v13i1.9554Keywords:
Integer programation, cut method, flow problem and minimum cutAbstract
In this work is presented an algorithm that solve a class of integer quadratic program problems. The algorithm solves a secuence of at most
problems of minimum cut over a graph with n + 2 vertex where n is the number of variables in the problem.
Downloads
Published
Issue
Section
License
Copyright (c) 2010 Edinson Raúl Montoro Alegre, Martha Hilda Timoteo Sánchez
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
THE AUTHORS RETAIN THEIR RIGHTS:
a) The authors retain their trademark and patent rights, and also on any process or procedure described in the article.
b) The authors retain the right to share, copy, distribute, execute and publicly communicate the article published in Pesquimat magazine (for example, place it in an institutional repository or publish it in a book), with recognition of its initial publication in the Pesquimat magazine.
c) The authors retain the right to make a later publication of their work, to use the article or any part of it (for example: a compilation of their works, notes for conferences, thesis, or for a book), provided that they indicate the source of publication (authors of the work, magazine, volume, number and date).
