Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
From MaRDI portal
Publication:2995815
DOI10.1134/S0965542510020041zbMath1224.90148WikidataQ57607353 ScholiaQ57607353MaRDI QIDQ2995815
Lidia A. Zaozerskaya, Alexander A. Kolokolov
Publication date: 4 May 2011
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
integer linear programmingdiscrete optimizationbranch-and-bound methodset packing problemGomory methodL-class enumeration
Related Items (2)
Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations
This page was built for publication: Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
