Estimation of the number of iterations in integer programming algorithms using the regular partitions method

DOI10.3103/S1066369X14010046zbMath1297.90091WikidataQ57607349 ScholiaQ57607349MaRDI QIDQ463771

Lidia A. Zaozerskaya, Alexander A. Kolokolov

Publication date: 17 October 2014

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

integer programmingdiscrete optimizationbranch and bound methodcuts\(L\)-class enumerationestimates of the number of iterationsestimates on averageregular partitions methodstability of algorithms

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
• Analysis of fractional covering of some supply management problems
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• An upper bound on the number of cuts needed in Gomory's method of integer forms
• On a quantitative measure of stability for a vector problem in integer programming
• Application of regular partitions in integer programming
• Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations
• On the stability of some integer programming algorithms
• Stability analysis of some discrete optimization algorithms
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• Analysis of the knapsack problem using L-partition
• Trivial integer programs unsolvable by branch-and-bound
• On an Algorithm of Gomory
• Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Estimation of the number of iterations in integer programming algorithms using the regular partitions method