Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem

DOI10.1287/opre.24.6.1120zbMath0343.90048OpenAlexW2039557883MaRDI QIDQ4111308

Stanley Zionts, Der-San Chen

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.6.1120

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to group theory (20-00)

Related Items (3)

How tight is the corner relaxation? ⋮ On the complexity of surrogate and group relaxation for integer linear programs ⋮ Alternative group relaxation of integer programming problems

This page was built for publication: Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem