IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/1193Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ankolekar, Suresh | - |
| dc.contributor.author | Patel, Nitin R. | - |
| dc.date.accessioned | 2010-03-14T10:12:36Z | - |
| dc.date.available | 2010-03-14T10:12:36Z | - |
| dc.date.copyright | 1985-09 | - |
| dc.date.issued | 2010-03-14T10:12:36Z | - |
| dc.identifier.uri | http://hdl.handle.net/11718/1193 | - |
| dc.description.abstract | This paper discusses minimum matching in a trinomial doubly convex bipartite graph. The graph consists of three categories of arcs forming a doubly convex structure. The matching involves lexicographical minimization in required order of categories. Due to the special structure of the problem, certain 'greedy' procedures are found to be optimal. | en |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | WP;1985/582 | - |
| dc.subject | Trinomial lattice | en |
| dc.subject | Convex bodies | en |
| dc.title | Complete matching in a trinomial doubly-convex complete bipartite graph | en |
| dc.type | Working Paper | en |
| Appears in Collections: | Working Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WP 1985_582.pdf | 330.46 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.