Galiciana. Patrimonio Digital de Galicia > Datos de rexistro

Está en:  › Datos de rexistro

Linked Open

A generalization of obligation rules for minimum cost spanning tree problems

Identificadores del recurso

European Journal of Operational Research, 211(1): 122-129 (2011)

03772217

http://hdl.handle.net/11093/1098

10.1016/j.ejor.2010.10.035

https://linkinghub.elsevier.com/retrieve/pii/S037722171000737X

Procedencia

Ficha

Título:: A generalization of obligation rules for minimum cost spanning tree problems
Tema:: 1207.06 Teoría de Juegos
Descrición:: Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. We give a generalization of such family. We prove that our family coincides with the set of rules satisfying an additivity property and a cost monotonicity property. We also provide two new characterizations for the family of obligation rules using the previous properties. In the first one, we add a property of separability; and in the second one, we add core selection.; Ministerio de Ciencia e Innovación | Ref. ECO2008-03484-C02-01-ECON; Xunta de Galicia | Ref. INCITE09-207-064-PR
Idioma:: English
Autor/Produtor:: Bergantiño Cid, Gustavo; Lorenzo Picado, Leticia; Lorenzo Freire, Silvia Maria
Editor:: European Journal of Operational Research; Estatística e investigación operativa; Research Group In Economic Analysis
Dereitos:: openAccess
Data:: 2019-01-08T09:55:44Z; 2011-05-16; 2019-01-08T09:45:23Z
Tipo de recurso:: article

oai_dc

<?xml version="1.0" encoding="UTF-8" ?>

< oai_dc:dc schemaLocation =" http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd " >
1. < dc:title > A generalization of obligation rules for minimum cost spanning tree problems </ dc:title >
2. < dc:creator > Bergantiño Cid, Gustavo </ dc:creator >
3. < dc:creator > Lorenzo Picado, Leticia </ dc:creator >
4. < dc:creator > Lorenzo Freire, Silvia Maria </ dc:creator >
5. < dc:subject > 1207.06 Teoría de Juegos </ dc:subject >
6. < dc:description > Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. We give a generalization of such family. We prove that our family coincides with the set of rules satisfying an additivity property and a cost monotonicity property. We also provide two new characterizations for the family of obligation rules using the previous properties. In the first one, we add a property of separability; and in the second one, we add core selection. </ dc:description >
7. < dc:description > Ministerio de Ciencia e Innovación | Ref. ECO2008-03484-C02-01-ECON </ dc:description >
8. < dc:description > Xunta de Galicia | Ref. INCITE09-207-064-PR </ dc:description >
9. < dc:publisher > European Journal of Operational Research </ dc:publisher >
10. < dc:publisher > Estatística e investigación operativa </ dc:publisher >
11. < dc:publisher > Research Group In Economic Analysis </ dc:publisher >
12. < dc:date > 2019-01-08T09:55:44Z </ dc:date >
13. < dc:date > 2019-01-08T09:55:44Z </ dc:date >
14. < dc:date > 2011-05-16 </ dc:date >
15. < dc:date > 2019-01-08T09:45:23Z </ dc:date >
16. < dc:type > article </ dc:type >
17. < dc:identifier > European Journal of Operational Research, 211(1): 122-129 (2011) </ dc:identifier >
18. < dc:identifier > 03772217 </ dc:identifier >
19. < dc:identifier > http://hdl.handle.net/11093/1098 </ dc:identifier >
20. < dc:identifier > 10.1016/j.ejor.2010.10.035 </ dc:identifier >
21. < dc:identifier > https://linkinghub.elsevier.com/retrieve/pii/S037722171000737X </ dc:identifier >
22. < dc:language > eng </ dc:language >
23. < dc:rights > openAccess </ dc:rights >
</ oai_dc:dc >

ore

<?xml version="1.0" encoding="UTF-8" ?>

< atom:entry >
1. < atom:id > http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1098/ore.xml </ atom:id >
2. < atom:link href =" http://hdl.handle.net/11093/1098 " rel =" alternate " />
3. < atom:link href =" http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1098/ore.xml " rel =" http://www.openarchives.org/ore/terms/describes " />
4. < atom:link href =" http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1098/ore.xml#atom " rel =" self " type =" application/atom+xml " />
5. < atom:published > 2019-01-09T03:36:39.710+01:00 </ atom:published >
6. < atom:updated > 2019-01-09T03:36:39.710+01:00 </ atom:updated >
7. < atom:source >
  1. < atom:generator uri =" http://www.investigo.biblioteca.uvigo.es/oai " > Investigo </ atom:generator >
  </ atom:source >
8. < atom:title > A generalization of obligation rules for minimum cost spanning tree problems </ atom:title >
9. < atom:author >
  1. < atom:name > Bergantiño Cid, Gustavo </ atom:name >
  </ atom:author >
10. < atom:author >
  1. < atom:name > Lorenzo Picado, Leticia </ atom:name >
  </ atom:author >
11. < atom:author >
  1. < atom:name > Lorenzo Freire, Silvia Maria </ atom:name >
  </ atom:author >
12. < atom:category label =" Aggregation " scheme =" http://www.openarchives.org/ore/terms/ " term =" http://www.openarchives.org/ore/terms/Aggregation " />
13. < atom:category scheme =" http://www.openarchives.org/ore/atom/modified " term =" 2019-01-08T10:55:44.463+01:00 " />
14. < atom:category label =" DSpace Item " scheme =" http://www.dspace.org/objectModel/ " term =" DSpaceItem " />
15. < atom:link href =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/sword.zip?sequence=3 " length =" 302435 " rel =" http://www.openarchives.org/ore/terms/aggregates " title =" sword.zip " type =" application/zip " />
16. < atom:link href =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/license.txt?sequence=2 " length =" 5578 " rel =" http://www.openarchives.org/ore/terms/aggregates " title =" license.txt " type =" text/plain; charset=utf-8 " />
17. < atom:link href =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/ejor-2.pdf?sequence=1 " length =" 320419 " rel =" http://www.openarchives.org/ore/terms/aggregates " title =" ejor-2.pdf " type =" application/pdf " />
18. < oreatom:triples >
  1. < rdf:Description about =" http://www.investigo.biblioteca.uvigo.es/oai/metadata/handle/11093/1098/ore.xml " >
    1. < rdf:type resource =" http://www.dspace.org/objectModel/DSpaceItem " />
    2. < dcterms:modified > 2019-01-08T10:55:44.463+01:00 </ dcterms:modified >
    </ rdf:Description >
  2. < rdf:Description about =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/sword.zip?sequence=3 " >
    1. < rdf:type resource =" http://www.dspace.org/objectModel/DSpaceBitstream " />
    2. < dcterms:description > SWORD </ dcterms:description >
    </ rdf:Description >
  3. < rdf:Description about =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/license.txt?sequence=2 " >
    1. < rdf:type resource =" http://www.dspace.org/objectModel/DSpaceBitstream " />
    2. < dcterms:description > LICENSE </ dcterms:description >
    </ rdf:Description >
  4. < rdf:Description about =" http://www.investigo.biblioteca.uvigo.es/xmlui/bitstream/handle/11093/1098/ejor-2.pdf?sequence=1 " >
    1. < rdf:type resource =" http://www.dspace.org/objectModel/DSpaceBitstream " />
    2. < dcterms:description > ORIGINAL </ dcterms:description >
    </ rdf:Description >
  </ oreatom:triples >
</ atom:entry >

qdc

<?xml version="1.0" encoding="UTF-8" ?>

< dcterms:dateAccepted schemaLocation =" http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd " > 2019-01-08T09:55:44Z </ dcterms:dateAccepted >

QDC

<?xml version="1.0" encoding="UTF-8" ?>

< dcterms:dateAccepted schemaLocation =" http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd " > 2019-01-08T09:55:44Z </ dcterms:dateAccepted >

rdf

<?xml version="1.0" encoding="UTF-8" ?>

< rdf:RDF schemaLocation =" http://www.w3.org/1999/02/22-rdf-syntax-ns# http://www.openarchives.org/OAI/2.0/rdf.xsd " >
1. < ow:Publication about =" oai:investigo.biblioteca.uvigo.es:11093/1098 " >
  1. < dc:creator > Bergantiño Cid, Gustavo </ dc:creator >
  2. < dc:creator > Lorenzo Picado, Leticia </ dc:creator >
  3. < dc:creator > Lorenzo Freire, Silvia Maria </ dc:creator >
  4. < dc:date > 2019-01-08T09:55:44Z </ dc:date >
  5. < dc:date > 2011-05-16 </ dc:date >
  6. < dc:identifier > European Journal of Operational Research, 211(1): 122-129 (2011) </ dc:identifier >
  7. < dc:identifier > 03772217 </ dc:identifier >
  8. < dc:identifier > http://hdl.handle.net/11093/1098 </ dc:identifier >
  9. < dc:description > Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. We give a generalization of such family. We prove that our family coincides with the set of rules satisfying an additivity property and a cost monotonicity property. We also provide two new characterizations for the family of obligation rules using the previous properties. In the first one, we add a property of separability; and in the second one, we add core selection. </ dc:description >
  10. < dc:description > Ministerio de Ciencia e Innovación | Ref. ECO2008-03484-C02-01-ECON </ dc:description >
  11. < dc:description > Xunta de Galicia | Ref. INCITE09-207-064-PR </ dc:description >
  12. < dc:language > eng </ dc:language >
  13. < dc:publisher > European Journal of Operational Research </ dc:publisher >
  14. < dc:title > A generalization of obligation rules for minimum cost spanning tree problems </ dc:title >
  15. < dc:type > article </ dc:type >
  16. < dc:rights > openAccess </ dc:rights >
  17. < dc:identifier > 10.1016/j.ejor.2010.10.035 </ dc:identifier >
  18. < dc:identifier > https://linkinghub.elsevier.com/retrieve/pii/S037722171000737X </ dc:identifier >
  19. < dc:publisher > Estatística e investigación operativa </ dc:publisher >
  20. < dc:publisher > Research Group In Economic Analysis </ dc:publisher >
  21. < dc:subject > 1207.06 Teoría de Juegos </ dc:subject >
  22. < dc:authorID > 57 </ dc:authorID >
  23. < dc:authorID > 3720 </ dc:authorID >
  24. < dc:authorID > 4775 </ dc:authorID >
  25. < dc:date > 2019-01-08T09:45:23Z </ dc:date >
  26. < dc:numberID > 5c34712ae0e6d4.73903406 </ dc:numberID >
  27. < dc:advertisements > Os dereitos do item foron comprobados polo sistema </ dc:advertisements >
  28. < dc:advertisements > Detectada alta manual de creadores. </ dc:advertisements >
  29. < dc:advertisements > Produciuse un cambio na cantidade, orde ou rol dos creadores propostotos polo sistema. </ dc:advertisements >
  30. < dc:computerCitation > pub_title=European Journal of Operational Research|volume=211|journal_number=1|start_pag=122|end_pag=129 </ dc:computerCitation >
  31. < dc:rights > Si </ dc:rights >
  32. < dc:source > Comunidad </ dc:source >
  33. < dc:source > Artículos </ dc:source >
  </ ow:Publication >
</ rdf:RDF >

suxi

<?xml version="1.0" encoding="UTF-8" ?>

< dcterms:dateAccepted > 2019-01-08T09:55:44Z </ dcterms:dateAccepted >

Xunta de Galicia. Información mantenida y publicada en internet por la Xunta de Galicia

Atención á cidadanía - Accesibilidade - Aviso legal - Mapa do portal