A maximum b-matching problem arising from median location models with applications to the roommates problem

Saved in:
Bibliographic Details
Published in:Mathematical programming 1998-01, Vol.80 (2), p.171-194
Main Authors: TAMIR, A, MITCHELL, J. S. B
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 194
container_issue 2
container_start_page 171
container_title Mathematical programming
container_volume 80
creator TAMIR, A
MITCHELL, J. S. B
description
doi_str_mv 10.1007/BF01581725
format article
fullrecord <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_2108486</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2108486</sourcerecordid><originalsourceid>FETCH-LOGICAL-p182t-1af01ceebd6568ce5ad26c9350cfc8dd85379bc07c262947dc57f1c43f8075463</originalsourceid><addsrcrecordid>eNo1zDtPwzAYhWELgUQpLPwCD6yBz3dnLBUtSJVYYK4cX4ghjiM7CPj3gArT0XuGB6FLAtcEQN3cboAITRQVR2hBOJMNl1weowUAFY2QBE7RWa2vAECY1gv0tsLJfMb0nnDXJDPbPo4veCq5G3zCpsT626HkhJN30Yx4yNbMMY84ZeeHij_i3GMzTUM8_BXPGc-9xyXn9CP6-s-do5Nghuov_naJnjd3T-v7Zve4fVivds1ENJ0bYgIQ633npJDaemEclbZlAmyw2jktmGo7C8pSSVuunBUqEMtZ0KAEl2yJrg7uZKo1QyhmtLHupxKTKV97SkBzLdk3gjNbgQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A maximum b-matching problem arising from median location models with applications to the roommates problem</title><source>Springer Nature</source><creator>TAMIR, A ; MITCHELL, J. S. B</creator><creatorcontrib>TAMIR, A ; MITCHELL, J. S. B</creatorcontrib><identifier>ISSN: 0025-5610</identifier><identifier>EISSN: 1436-4646</identifier><identifier>DOI: 10.1007/BF01581725</identifier><identifier>CODEN: MHPGA4</identifier><language>eng</language><publisher>Heidelberg: Springer</publisher><subject>Applied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>Mathematical programming, 1998-01, Vol.80 (2), p.171-194</ispartof><rights>1998 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=2108486$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>TAMIR, A</creatorcontrib><creatorcontrib>MITCHELL, J. S. B</creatorcontrib><title>A maximum b-matching problem arising from median location models with applications to the roommates problem</title><title>Mathematical programming</title><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0025-5610</issn><issn>1436-4646</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNo1zDtPwzAYhWELgUQpLPwCD6yBz3dnLBUtSJVYYK4cX4ghjiM7CPj3gArT0XuGB6FLAtcEQN3cboAITRQVR2hBOJMNl1weowUAFY2QBE7RWa2vAECY1gv0tsLJfMb0nnDXJDPbPo4veCq5G3zCpsT626HkhJN30Yx4yNbMMY84ZeeHij_i3GMzTUM8_BXPGc-9xyXn9CP6-s-do5Nghuov_naJnjd3T-v7Zve4fVivds1ENJ0bYgIQ633npJDaemEclbZlAmyw2jktmGo7C8pSSVuunBUqEMtZ0KAEl2yJrg7uZKo1QyhmtLHupxKTKV97SkBzLdk3gjNbgQ</recordid><startdate>19980116</startdate><enddate>19980116</enddate><creator>TAMIR, A</creator><creator>MITCHELL, J. S. B</creator><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>19980116</creationdate><title>A maximum b-matching problem arising from median location models with applications to the roommates problem</title><author>TAMIR, A ; MITCHELL, J. S. B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p182t-1af01ceebd6568ce5ad26c9350cfc8dd85379bc07c262947dc57f1c43f8075463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>TAMIR, A</creatorcontrib><creatorcontrib>MITCHELL, J. S. B</creatorcontrib><collection>Pascal-Francis</collection><jtitle>Mathematical programming</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>TAMIR, A</au><au>MITCHELL, J. S. B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A maximum b-matching problem arising from median location models with applications to the roommates problem</atitle><jtitle>Mathematical programming</jtitle><date>1998-01-16</date><risdate>1998</risdate><volume>80</volume><issue>2</issue><spage>171</spage><epage>194</epage><pages>171-194</pages><issn>0025-5610</issn><eissn>1436-4646</eissn><coden>MHPGA4</coden><cop>Heidelberg</cop><pub>Springer</pub><doi>10.1007/BF01581725</doi><tpages>24</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0025-5610
ispartof Mathematical programming, 1998-01, Vol.80 (2), p.171-194
issn 0025-5610
1436-4646
language eng
recordid cdi_pascalfrancis_primary_2108486
source Springer Nature
subjects Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
title A maximum b-matching problem arising from median location models with applications to the roommates problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T06%3A19%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20maximum%20b-matching%20problem%20arising%20from%20median%20location%20models%20with%20applications%20to%20the%20roommates%20problem&rft.jtitle=Mathematical%20programming&rft.au=TAMIR,%20A&rft.date=1998-01-16&rft.volume=80&rft.issue=2&rft.spage=171&rft.epage=194&rft.pages=171-194&rft.issn=0025-5610&rft.eissn=1436-4646&rft.coden=MHPGA4&rft_id=info:doi/10.1007/BF01581725&rft_dat=%3Cpascalfrancis%3E2108486%3C/pascalfrancis%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p182t-1af01ceebd6568ce5ad26c9350cfc8dd85379bc07c262947dc57f1c43f8075463%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true