Parametric formulation of the general integer linear programming problem
type: Item
instance of: scholarly article
title: Parametric formulation of the general integer linear programming problem
zbMATH Open document ID: 0854.90099
DOI: 10.1016/0305-0548(94)00077-L
author: A. Joseph
published in: Computers \& Operations Research
publication date: 1997-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 910347
zbMATH Keywords: heuristic
zbMATH Keywords: parametric approach
zbMATH Keywords: integer programming
zbMATH Keywords: convex polytope
MaRDI profile type: Publication
cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior
cites work: A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables
cites work: All-integer linear programming — a new approach via dynamic programming
cites work: A surrogate cutting plane algorithm for all-integer programming
cites work: An advanced dual algorithm with constraint relaxation for all-integer programming
cites work: An exact ceiling point algorithm for general integer linear programming
cites work: A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: Cyclic Scheduling via Integer Programs with Circular Ones
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Q3346090
cites work: Vertex packings: Structural properties and algorithms
cites work: ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
cites work: An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
full work available at URL: 0305-0548(94)00077-l
OpenAlex ID: W2072775075
description: scientific article; zbMATH DE number 910347