Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An algorithm for the committee construction problem

From MaRDI portal
Publication:1333475
Jump to:navigation, search

DOI10.1016/0377-2217(94)90028-0zbMath0809.90094OpenAlexW1969007301MaRDI QIDQ1333475

Ömer Saatçioǧlu, Demet Ceylan, Canan Sepil

Publication date: 28 March 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90028-0


zbMATH Keywords

transportationbottleneck assignmentmultiple criteria problemscommittee construction


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Case-oriented studies in operations research (90B90)


Related Items (1)

Operational research in education




Cites Work

  • Unnamed Item
  • Time-Cost Trade-Off Analysis in Some Constrained Assignment Problems
  • Bicriteria Transportation Problem
  • Some Generalisations of the Time Minimising Assignment Problem
  • Bottleneck Linear Programming
  • Time‐minimizing transportation problems
  • The bottleneck transportation problem




This page was built for publication: An algorithm for the committee construction problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1333475&oldid=13471253"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki