A surrogate cutting plane algorithm for all-integer programming

DOI10.1016/0305-0548(85)90023-1zbMath0608.90073OpenAlexW2038141985MaRDI QIDQ1086159

Parviz Ghandforoush, Larry M. Austin

Publication date: 1985

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(85)90023-1

zbMATH Keywords

LP relaxationall-integer cutting plane techniquesurrogate cutting plane algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (5)

Solution approaches for highly primal- and dual-degenerate all-integer programming problems ⋮ The mixed cutting plane algorithm for all-integer programming ⋮ A computational study of an objective hyperplane search heuristic for the general integer linear programming problem ⋮ Parametric formulation of the general integer linear programming problem ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models

Cites Work

• Unnamed Item
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• A primal-dual cutting-plane algorithm for all-integer programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• Iteration Skipping in Primal Integer Programming
• A pseudo primal-dual integer programming algorithm
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• Surrogate Constraints
• Integer Linear Programming: A Study in Computational Efficiency
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables

This page was built for publication: A surrogate cutting plane algorithm for all-integer programming