Bicriterial problem of decomposition of a production system

From MaRDI portal

Revision as of 06:43, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2567625

Jump to:navigation, search

zbMath1083.90525MaRDI QIDQ2567625

M. V. Evdokimov, V. G. Mednitskii, I. Kh. Sigal

Publication date: 11 October 2005

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Production models (90B30)

Related Items (1)

Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives

This page was built for publication: Bicriterial problem of decomposition of a production system

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2567625&oldid=15319395"