A framework for constructing general integer problems with well-determined duality gaps

DOI10.1016/S0377-2217(01)00035-2zbMath1087.90522MaRDI QIDQ5955093

Anito Joseph, Saul I. Gass

Publication date: 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Linear programmingDuality gapGeneral integer programmingTest problem generation

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Uses Software

• OR-Library

Cites Work

• Evaluating mathematical programming techniques. Proceedings of a Conference Held at the National Bureau of Standards, Boulder, Colorado, January 5-6, 1981
• Cutting planes for integer programs with general integer variables
• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• Parametric formulation of the general integer linear programming problem
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
• An exact ceiling point algorithm for general integer linear programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior

This page was built for publication: A framework for constructing general integer problems with well-determined duality gaps