Alternative group relaxation of integer programming problems

DOI10.1016/0166-218X(84)90097-0zbMath0541.90074MaRDI QIDQ794928

C. Leporelli, Mario Lucertini, Paola Bertolazzi

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

relaxationapproximate algorithmsNumerical resultscomplexity of solution algorithmsgroup problems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Cutting-plane theory: Algebraic methods
• Constructive Group Relaxations for Integer Programs
• Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• 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
• Integer Linear Programming: A Study in Computational Efficiency
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems

This page was built for publication: Alternative group relaxation of integer programming problems