An extension of Hu's group minimization algorithm

DOI10.1007/BF02576759MaRDI QIDQ1254946zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 1978

Published in Calcolo (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• 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 3410784 (Why is no real title available?)
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Computational experience with a group theoretic integer programming algorithm
• 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 Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• On the asymptotic integer algorithm
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• Some polyhedra related to combinatorial problems
• Turnpike Theorems for Integer Programming Problems

This page was built for publication: An extension of Hu's group minimization algorithm

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