Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
From MaRDI portal
Publication:5675137
DOI10.1007/BF01956854zbMath0259.90020MaRDI QIDQ5675137
Publication date: 1973
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Related Items
Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, A branch and bound algorithm for extreme point mathematical programming problems, A finite procedure to generate feasible points for the extreme point mathematical programming problem, A finite algorithm for solving the generalized lattice point problem
Cites Work