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

DOI10.3103/S1066369X14010046zbMATH Open1297.90091WikidataQ57607349 ScholiaQ57607349MaRDI QIDQ463771FDOQ463771

Authors: A. A. Kolokolov, L. A. Zaozerskaya 

Publication date: 17 October 2014

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

Recommendations

• scientific article; zbMATH DE number 808805
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations
• Application of regular partitions in integer programming
• scientific article; zbMATH DE number 1859294

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities
• An asymptotic estimate for the complexity of the branch and bound method with branching with respect to a fractional variable for the knapsack problem
• The set covering problem: Complexity, algorithms, experiments
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis of the knapsack problem using L-partition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trivial integer programs unsolvable by branch-and-bound
• Title not available (Why is that?)
• Title not available (Why is that?)
• On an Algorithm of Gomory
• Technical Note—A Counterexample to the Rudimentary Primal Integer Programming Algorithm
• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
• Analysis of fractional covering of some supply management problems

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Application of regular partitions in integer programming
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463771)