An Approximate Algorithm for Discrete Linear Programming

DOI10.1109/TSSC.1969.300246MaRDI QIDQ5576129zbMATH OpenFDO

Authors 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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576129)