Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations

DOI10.1134/S0005117912020142zbMath1307.90110MaRDI QIDQ2261724

M. F. Rybalka, T. G. Orlovskaya, Alexander A. Kolokolov

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Finding Symmetry Groups of Some Quadratic Programming Problems ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method

Cites Work

• A branch and cut solver for the maximum stable set problem
• One approach to solving a discrete production planning problem with interval data
• Column basis reduction and decomposable knapsack problems
• Upper bounds on the average number of iterations for some algorithms of solving the set packing problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations