Solving partially integer-valued optimization problems which are convex relative to a continuous variable
From MaRDI portal
Publication:3942754
DOI10.1007/BF01068783zbMath0483.90080MaRDI QIDQ3942754
N. V. Semenova, V. A. Roshchin, Ivan V. Sergienko
Publication date: 1981
Published in: Cybernetics (Search for Journal in Brave)
exact solutionapproximate solutionapproximate algorithmsBenders' decompositionexistence of optimal solutionextension of Benders' methodpartially convex problempartially integer-valued optimization problem
Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Fractional programming (90C32)
Related Items
Cites Work