scientific article; zbMATH DE number 808805

zbMath0837.90090MaRDI QIDQ4852854

Alexander A. Kolokolov

Publication date: 17 March 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyhybrid algorithmscutting planes\(L\)-partitionregular partition\(L\)-class enumerationlexicographical orderfractional cutting plane algorithms

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Cutting-plane method based on epigraph approximation with discarding the cutting planes ⋮ Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests ⋮ Estimation of the number of iterations in integer programming algorithms using the regular partitions method ⋮ ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH ⋮ ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM ⋮ \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities ⋮ Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations ⋮ Discrete optimization with logical constraints for design of complex products ⋮ A cutting-plane method without inclusions of approximating sets for conditional minimization ⋮ Unnamed Item ⋮ A two-stage cutting-plane method for conditional minimizing function