Paper Info
Title
Technical Note-On Intersection Cuts in Interval Integer Linear Programming
Abstract
In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane algorithm for solving integer interval linear programming problems. The idea is to apply the cutting-plane algorithm directly on the interval problem without transforming the problem into an equivalent standard integer problem. Such a transformation would significantly increase the effective size of the problem.
Year
DOI
Venue
1977
10.1287/opre.25.2.352
Operations Research
Field
DocType
Volume
Discrete mathematics,Integer overflow,Mathematical optimization,Change-making problem,Branch and cut,Branch and price,Integer points in convex polyhedra,Integer programming,Cutting stock problem,Linear programming relaxation,Mathematics
Journal
25
Issue
ISSN
Citations 
2
0030-364X
0
PageRank 
References 
Authors
0.34
2
3
Name
Order
Citations
PageRank
A. Charnes1271145.50
D. Granot231.48
Frieda Granot314738.59