A computational study of an objective hyperplane search heuristic for the general integer linear programming problem

DOI10.1016/S0895-7177(97)00075-7zbMath0880.65035OpenAlexW2040990250MaRDI QIDQ1368436

Anito Joseph, Saul I. Gass, N. A. Bryson

Publication date: 22 January 1998

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(97)00075-7

zbMATH Keywords

heuristic algorithmgeneral integer programmingbounded knapsack problemobjective hyperplane search

Mathematics Subject Classification ID

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

Related Items (1)

An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane

Uses Software

• OSL

Cites Work

• Unnamed Item
• A surrogate cutting plane algorithm for all-integer programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• All-integer linear programming — a new approach via dynamic programming
• An exact ceiling point algorithm for general integer linear programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Letter to the Editor—Computational Results of an Integer Programming Algorithm
• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• An Enumeration Algorithm for Knapsack Problems
• Hyperplane Search Algorithms for the Solution of Integer Programming Problems

This page was built for publication: A computational study of an objective hyperplane search heuristic for the general integer linear programming problem