Bi-criteria assignment problem

From MaRDI portal

Revision as of 04:54, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:1165772

Jump to:navigation, search

zbMath0487.90058MaRDI QIDQ1165772

Rita Malhotra, H. L. Bhatia, Munish C. Puri

Publication date: 1982

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

linear objective functions bi-criteria assignment problem computation of efficient pairs time bound assignment

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (6)

A bi-criteria approach for the data association problem ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ A population-based algorithm for solving linear assignment problems with two objectives ⋮ A labeling algorithm for the fuzzy assignment problem. ⋮ A hybrid method for solving the multi-objective assignment problem ⋮ Two phase algorithms for the bi-objective assignment problem

This page was built for publication: Bi-criteria assignment problem

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