Journal ArticleDOI
A Graph-Theoretic Equivalence for Integer Programs
TLDR
An equivalence is established between solving 0-1 integer programs with quadratic or linear objective functions and solving a cut problem on a related graph.Abstract:
This paper is concerned with the relation between 0-1 integer programs and graphs. An equivalence is established between solving 0-1 integer programs with quadratic or linear objective functions and solving a cut problem on a related graph.read more
Citations
More filters
Journal ArticleDOI
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
TL;DR: This is a bibliography of signed graphs and related mathematics, where work on weighted graphs are regarded as outside the scope of the bibliography — except (to some extent) when the author calls the weights "signs".
Journal ArticleDOI
Minimum cuts and related problems
Jean-Claude Picard,H. D. Ratliff +1 more
TL;DR: This characterization of a cut in a network provides a fundamental equivalence between directed pseudosummetric networks and undirected networks and identifies a class of problems which can be solved as minimum cut problems on a network.
Heuristic algorithms for the unconstrained binary quadratic programming problem
TL;DR: This paper typifies a "multiple solution technique, single paper" approach, i.e. an approach that within the same paper presents results for a number of different heuristics applied to the same problem.
Book ChapterDOI
Methods of Nonlinear 0-1 Programming
TL;DR: The main results of various approaches to the solution of nonlinear programs in 0-1 variables, as well as some of the many applications, are summarized.
Journal ArticleDOI
Selected Applications of Minimum Cuts in Networks
TL;DR: In this paper, a review and a synthesis of applications of minimum cuts to a variety of combinatorial optimization problems, including linear and non-linear integer programming, problems in location theory, graph theory, sequencing and scheduling, and other areas is provided.