On the Group Problem and a Subadditive Approach to Integer Programming

DOI10.1016/S0167-5060(08)70345-5MaRDI QIDQ4197623zbMATH OpenOpenAlexFDO

Authors 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 (Search for Journal in Brave)

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

zbMATH Keywords

Blocking FrameworkCyclic Group ProblemFractional Cutting PlanesGroup Theoretic ApproachInteger ProgrammingKnapsack Covering ProblemLinear RelaxationStrong DualitySubadditive Characterization

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(11)

• The b-hull of an integer program
• A primal dual integer programming algorithm
• Theoretical challenges towards cutting-plane selection
• Some cut-generating functions for second-order conic sets
• Subadditive duality in multiobjective integer linear programming
• Duality for mixed-integer convex minimization
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• Integer programming duality: Price functions and sensitivity analysis
• An elementary survey of general duality theory in mathematical programming
• The gap function: evaluating integer programming models over multiple right-hand sides
• Coordination of manufacturing and engineering activities during product transitions

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

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