Algorithm to find the allowable solution of integer linear programming problems
From MaRDI portal
Publication:3793941
DOI10.1007/BF01071780zbMath0648.90056OpenAlexW2091557593MaRDI QIDQ3793941
Publication date: 1987
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01071780
integer linear programmingparallelepipedsequential analysisdomain approximationdiscrete programmingallowable solutionscreening of variants
Cites Work
This page was built for publication: Algorithm to find the allowable solution of integer linear programming problems