Computational experience with a group theoretic integer programming algorithm

DOI10.1007/BF01584659MaRDI QIDQ5671787zbMATH OpenFDO

Authors G. Anthony Gorry, William D. Northup, Jeremy F. Shapiro

Publication date 1973

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01584659

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites work

• A note on two problems in connexion with graphs
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• An Appraisal of Some Shortest-Path Algorithms
• An Improved Implicit Enumeration Approach for Integer Programming
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• Extensions of the Group Theoretic Approach in Integer Programming
• Generalized Lagrange Multipliers in Integer Programming
• Group-Theoretic Results in Mixed Integer Programming
• scientific article; zbMATH DE number 3523324 (Why is no real title available?)
• scientific article; zbMATH DE number 3523329 (Why is no real title available?)
• scientific article; zbMATH DE number 3314878 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• scientific article; zbMATH DE number 3420483 (Why is no real title available?)
• Integer Programming over a Finite Additive Group
• On the asymptotic integer algorithm
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• Some continuous functions related to corner polyhedra
• Some polyhedra related to combinatorial problems

Cited in

(9)

• An extension of Hu's group minimization algorithm
• The propagation of updates to relational tables in a distributed database system
• Extended formulations for Gomory corner polyhedra
• A solution method for a knapsack problem and its variant
• Efficient group cuts for integer programs
• 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
• A note on the solution of group knapsack problems
• Non-standard approaches to integer programming

This page was built for publication: Computational experience with a group theoretic integer programming algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671787)