Equivalence among optimization problems on matrix sets

DOI10.1016/0166-218X(83)90096-3MaRDI QIDQ1838428zbMATH OpenFDO

Authors E. Ya. Gabovich, Mark Burgin

Publication date 1983

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(83)90096-3

zbMATH Keywords

bottle-neck problemscombinatorial optimizationdiscrete programmingequivalencyfinite ordered algebraic structureoptimization on matrix setstotally ordered commutative semigroups

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Commutative semigroups (20M14) Integer programming (90C10) Programming in abstract spaces (90C48)

Cites work

• An equivalency problem in discrete programming over ordered semigroups
• FULLY ORDERED SEMIGROUPS AND THEIR APPLICATIONS
• scientific article; zbMATH DE number 3668366 (Why is no real title available?)
• scientific article; zbMATH DE number 3371831 (Why is no real title available?)
• On spectral theory in discrete programming

This page was built for publication: Equivalence among optimization problems on matrix sets

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