A primal dual integer programming algorithm

DOI10.1016/0166-218X(93)90014-FzbMath0794.90040MaRDI QIDQ1309813

V. Pereyra

Publication date: 4 January 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum weight matchingChvatal functionlinear integer problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (3)

Subadditive approaches in integer programming ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ A Gilmore-Gomory construction of integer programming value functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The b-hull of an integer program
• The value function of a mixed integer program: I
• Cutting-plane theory: Algebraic methods
• Edmonds polytopes and a hierarchy of combinatorial problems
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Outline of an algorithm for integer solutions to linear programs
• Computational Complexity of Some Problems in Parametric Discrete Programming. I
• On Cutting Planes
• Integer programming duality: Price functions and sensitivity analysis
• The value function of an integer program
• Odd Minimum Cut-Sets and b-Matchings
• On the Group Problem and a Subadditive Approach to Integer Programming
• An Introduction to the Theory of Cutting-Planes
• Paths, Trees, and Flowers

This page was built for publication: A primal dual integer programming algorithm