Computational experience with a group theoretic integer programming algorithm
TLDR
The innovative subroutines are shown to be efficient to compute and effective in finding good integer programming solutions and providing strong lower bounds for the branch and bound search.Abstract:
This paper gives specific computational details and experience with a group theoretic integer programming algorithm. Included among the subroutines are a matrix reduction scheme for obtaining group representations, network algorithms for solving group optimization problems, and a branch and bound search for finding optimal integer programming solutions. The innovative subroutines are shown to be efficient to compute and effective in finding good integer programming solutions and providing strong lower bounds for the branch and bound search.read more
Citations
More filters
Journal ArticleDOI
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
Ravi Kannan,Achim Bachem +1 more
TL;DR: Recently, Frumkin pointed out that none of the well-known algorithms that transform an integer matrix into Smith or Hermite normal form is known to be polynomially bounded in its runn...
Book ChapterDOI
A Survey of Lagrangian Techniques for Discrete Optimization.
TL;DR: This chapter discusses a number of questions about this method for trying to solve zero–one integer programming (IP) problems and its relevance for optimizing the original IP problem.
Book ChapterDOI
On the group problem for mixed integer programming
TL;DR: In this article, a theory for a group problem arising from mixed integer programming is developed, which gives descriptions of functions on the unit hypercube from which cutting planes can be constructed for any mixed integer program.
Book ChapterDOI
Using duality to solve discrete optimization problems: theory and computational experience*
TL;DR: A general class of discrete optimization problem is given for which dual problems of this type may be derived and the use of dual problems for obtaining strong bounds, feasible solutions, and for guiding the search in enumeration schemes for this class of problems is discussed.
Book ChapterDOI
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
TL;DR: An optimal solution to the problem that is able to be solved gives some new information on the 1-widths of members of this class of (0,1)-matrices.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
An Appraisal of Some Shortest-Path Algorithms
TL;DR: In this article, five discrete shortest-path problems are treated: finding the shortest path between two specified nodes of a network, determining the shortest paths between all pairs of nodes in a network; determining the second, third, etc., shortest path; 4 determining the fastest path through a network with travel times depending on the departure time; and 5 finding the short path between specified endpoints that passes through specified intermediate nodes.
Book
Integer Programming and Network Flows
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
Some polyhedra related to combinatorial problems
TL;DR: In this article, a theory and algorithms for asymptotic integer programs are described and a class of polyhedra is introduced, which are cross sections of more symmetric higher dimensional polyhedras whose properties are then studied.