Computational experience with a group theoretic integer programming algorithm
From MaRDI portal
Publication:5671787
DOI10.1007/BF01584659zbMath0256.90037MaRDI QIDQ5671787
G. Anthony Gorry, William D. Northup, Jeremy F. Shapiro
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
A note on the solution of group knapsack problems, Extended formulations for Gomory corner polyhedra, The propagation of updates to relational tables in a distributed database system, Efficient group cuts for integer programs, A solution method for a knapsack problem and its variant, Non-standard approaches to integer programming, An extension of Hu's group minimization algorithm, A comparative study of algorithms for computing the Smith normal form of an integer matrix†, A new storage reduction technique for the solution of the group problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Some polyhedra related to combinatorial problems
- On the asymptotic integer algorithm
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- An Appraisal of Some Shortest-Path Algorithms
- An Improved Implicit Enumeration Approach for Integer Programming
- Integer Programming over a Finite Additive Group
- Generalized Lagrange Multipliers in Integer Programming
- Relaxation Methods for Pure and Mixed Integer Programming Problems
- An Adaptive Group Theoretic Algorithm for Integer Programming Problems
- Group-Theoretic Results in Mixed Integer Programming
- Extensions of the Group Theoretic Approach in Integer Programming
- Some continuous functions related to corner polyhedra
