An equivalency problem in discrete programming over ordered semigroups

DOI10.1007/BF02194748MaRDI QIDQ1843494zbMATH OpenFDO

Authors E. Ya. Gabovich

Publication date 1974

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/134026

Mathematics Subject Classification ID

Integer programming (90C10) Ordered semigroups and monoids (06F05)

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3338967 (Why is no real title available?)
• Note on the Archimedean property in an ordered semigroup
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

Cited in

(4)

• Universal conditions for algebraic travelling salesman problems to be efficiently solvable
• On spectral theory in discrete programming
• An algebraic approach to assignment problems
• Equivalence among optimization problems on matrix sets

This page was built for publication: An equivalency problem in discrete programming over ordered semigroups

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