An extension of Hu's group minimization algorithm

DOI10.1007/BF02576759zbMath0399.90059OpenAlexW1988097027MaRDI QIDQ1254946

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
• Turnpike Theorems for Integer Programming Problems
• Generalized Lagrange Multipliers in Integer Programming
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Extensions of the Group Theoretic Approach in Integer Programming
• Computational experience with a group theoretic integer programming algorithm

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