The Generalized Lattice-Point Problem
From MaRDI portal
Publication:5181531
DOI10.1287/opre.21.1.141zbMath0272.90040OpenAlexW1971832575MaRDI QIDQ5181531
Fred Glover, Darwin D. Klingman
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.141
Related Items
A branch and bound algorithm for extreme point mathematical programming problems, Introduction to QUBO, Mathematical Programming Models and Exact Algorithms, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Nonlinear 0–1 programming: I. Linearization techniques, Cut search methods in integer programming, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, A simplex procedure for linear programs with some 0-1 integer constraints, Membership functions, some mathematical programming models and production scheduling, A finite algorithm for solving the generalized lattice point problem, Quasi-concave minimization subject to linear constraints, A revised Taha's algorithm for polynomial 0-1 programming, Improved convexity cuts for lattice point problems, Polyhedral annexation in mixed integer and combinatorial programming, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, Disjunctive programming: Properties of the convex hull of feasible points, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Polyhedral convexity cuts and negative edge extensions
