An equivalency problem in discrete programming over ordered semigroups

DOI10.1007/BF02194748zbMath0279.90026MaRDI QIDQ1843494

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)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Note on the Archimedean property in an ordered semigroup