On a class of assignment problems.

DOI10.1007/BF03398545MaRDI QIDQ2468576zbMATH OpenOpenAlexFDO

Authors V. V. Venkata Ramana, C. Umasankar

Publication date 25 January 2008

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03398545

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 3743004 (Why is no real title available?)
• scientific article; zbMATH DE number 3231693 (Why is no real title available?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• A tree-search algorithm for mixed integer programming problems
• An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
• Modeling Facility Location Problems as Generalized Assignment Problems
• Multicommodity Distribution System Design by Benders Decomposition

This page was built for publication: On a class of assignment problems.

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