Solution approaches for highly primal- and dual-degenerate all-integer programming problems

DOI10.1016/0305-0548(85)90010-3zbMath0606.90094OpenAlexW2046083089MaRDI QIDQ1085064

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)90010-3

zbMATH Keywords

cutting plane techniquesall-integer programming

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An advanced start algorithm for all-integer programming
• A surrogate cutting plane algorithm for all-integer programming
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• 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
• A tree-search algorithm for mixed integer programming problems
• A Simplified Primal (All-Integer) Integer Programming Algorithm
• Integer Linear Programming: A Study in Computational Efficiency
• Relaxation Methods for Pure and Mixed Integer Programming Problems
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems

This page was built for publication: Solution approaches for highly primal- and dual-degenerate all-integer programming problems