What makes integer programming problems hard to solve: An empirical study

zbMath0397.90076MaRDI QIDQ1254013

Benjamin W. Lin, Ronald L. Rardin

Publication date: 1978

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

Empirical StudyInteger ProgrammingBranch- And-Bound AlgorithmsCutting Plane AlgorithmRandom Test Problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (2)

Experimentation in optimization ⋮ A continuous approach to nonlinear integer programming

This page was built for publication: What makes integer programming problems hard to solve: An empirical study