Integer programming and convex analysis: Intersection cuts from outer polars

Publisher Website

1 February 1972

journal article
Published by Springer Nature in Mathematical Programming

Vol. 2 (1), 330-382
https://doi.org/10.1007/bf01584553

Abstract

No abstract available

Keywords

This publication has 11 references indexed in Scilit:

Canonical Cuts on the Unit Hypercube
SIAM Journal on Applied Mathematics, 1972
Ranking the facets of the octahedron
Discrete Mathematics, 1972
Enumerative inequalities in integer programming
Mathematical Programming, 1972
An Intersection Cut from the Dual of the Unit Hypercube
Operations Research, 1971
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Operations Research, 1971
Convex Analysis
Published by Walter de Gruyter GmbH ,1970
Some polyhedra related to combinatorial problems
Linear Algebra and its Applications, 1969
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
Operations Research, 1969
Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
Operations Research, 1968
ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
Proceedings of the National Academy of Sciences, 1965

Cited by 42 articles