Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Merged Item from Q5919393
 
(3 intermediate revisions by 2 users not shown)
description / endescription / en
scientific article; zbMATH DE number 7241666
scientific article; zbMATH DE number 7164375
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1436.91008 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-030-17953-3_31 / rank
 
Normal rank
Property / published in
 
Property / published in: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / publication date
 
6 February 2020
Timestamp+2020-02-06T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 6 February 2020 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7164375 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962931423 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1803.03249 / rank
 
Normal rank

Latest revision as of 09:45, 6 May 2024

scientific article; zbMATH DE number 7164375
Language Label Description Also known as
English
Computing the nucleolus of weighted cooperative matching games in polynomial time
scientific article; zbMATH DE number 7164375

    Statements

    Computing the nucleolus of weighted cooperative matching games in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 August 2020
    0 references
    6 February 2020
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    algorithmic game theory
    0 references
    matchings
    0 references
    0 references
    0 references
    0 references