Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures

DOI10.1287/opre.24.6.1169zbMath0347.90063OpenAlexW1971625902MaRDI QIDQ4117603

Ronald L. Rardin, V. E. Unger

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.6.1169

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (3)

Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs ⋮ Mixed-integer bilinear programming problems ⋮ Enumeration approach for linear complementarity problems based on a reformulation-linearization technique

This page was built for publication: Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures