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

DOI10.1016/S0895-7177(97)00075-7MaRDI QIDQ1368436zbMATH OpenOpenAlexFDO

Authors A. 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

bounded knapsack problemgeneral integer programmingheuristic algorithmobjective hyperplane search

Mathematics Subject Classification ID

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

Recommendations

• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• A new implicit enumerative search for the solution to an integer linear program

Cites work

• A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• A surrogate cutting plane algorithm for all-integer programming
• All-integer linear programming — a new approach via dynamic programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• An Enumeration Algorithm for Knapsack Problems
• An exact ceiling point algorithm for general integer linear programming
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Hyperplane Search Algorithms for the Solution of Integer Programming Problems
• Letter to the Editor—Computational Results of an Integer Programming Algorithm

Cited in

(5)

• An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
• General purpose heuristics for integer programming. II
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• A heuristic algorithm for solving integer linear programming problem and unveiling the applications
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane

Describes a project that uses

Uses Software

• OSL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368436)