On the Group Problem and a Subadditive Approach to Integer Programming

DOI10.1016/S0167-5060(08)70345-5zbMath0409.90060OpenAlexW132826041MaRDI QIDQ4197623

Ellis L. Johnson

Publication date: 1979

Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70345-5

zbMATH Keywords

Integer ProgrammingStrong DualityGroup Theoretic ApproachBlocking FrameworkCyclic Group ProblemFractional Cutting PlanesKnapsack Covering ProblemLinear RelaxationSubadditive Characterization

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (11)

Duality for mixed-integer convex minimization ⋮ Theoretical challenges towards cutting-plane selection ⋮ The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides ⋮ Coordination of manufacturing and engineering activities during product transitions ⋮ The b-hull of an integer program ⋮ Some cut-generating functions for second-order conic sets ⋮ Subadditive duality in multiobjective integer linear programming ⋮ Integer programming duality: Price functions and sensitivity analysis ⋮ An elementary survey of general duality theory in mathematical programming ⋮ On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs ⋮ A primal dual integer programming algorithm

This page was built for publication: On the Group Problem and a Subadditive Approach to Integer Programming