An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

DOI10.1016/S0377-2217(97)00011-8zbMath0955.90110MaRDI QIDQ1291694

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

Publication date: 22 February 2001

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

zbMATH Keywords

bounded knapsack problemcomposite constraintsgeneral integer variablesinteger-programmingobjective hyperplane search

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

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

Uses Software

• OSL

Cites Work

• Unnamed Item
• An Automatic Method of Solving Discrete Programming Problems
• An advanced dual algorithm with constraint relaxation for all-integer programming
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Some Lessons in Solving Practical Integer Programs
• Surrogate Constraint Duality in Mathematical Programming
• All-integer linear programming — a new approach via dynamic programming
• Capacity Acquisition and Disposal with Discrete Facility Sizes
• An exact ceiling point algorithm for general integer linear programming
• Discrete Programming by the Filter Method
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Surrogate Constraints
• An Improved Implicit Enumeration Approach for Integer 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
• Surrogate Mathematical Programming
• Hyperplane Search Algorithms for the Solution of Integer Programming Problems

This page was built for publication: An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem