An Approximate Algorithm for Discrete Linear Programming

DOI10.1109/TSSC.1969.300246zbMath0184.23102MaRDI QIDQ5576129

Emanuele Biondi, Roberto Schmid

Publication date: 1969

Published in: IEEE Transactions on Systems Science and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items (1)

Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick)

This page was built for publication: An Approximate Algorithm for Discrete Linear Programming