2006
DOI: 10.1007/11766247_2
|View full text |Cite
|
Sign up to set email alerts
|

A Pruning-Based Algorithm for Computing Optimal Coalition Structures in Linear Production Domains

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 10 publications
0
2
0
Order By: Relevance
“…Remarkably, integer linear programming and mixed integer programming have been applied to corporate tax structuring, collaborative transportation, inventory management and robot system design, to name but a few (see e.g., Lin & Salkin, 1983;Baca et al, 2014;Guajardo & Rönnqvist, 2015;Guajardo et al, 2018). And, branch and bound-based algorithms have been often used in profit maximization of the production system; customer coalitions in electronic marketplaces to extract group discounts, node coalitions in grid computing for coordinated resources; forming cars to minimize the travel cost of the overall system, tackling social ridesharing problems and so on (see e.g., Sombattheera & Ghose, 2006;Banerjee & Kraemer, 2010;Bistaffa et al, 2015Bistaffa et al, , 2017.…”
Section: Macro Analysismentioning
confidence: 99%
“…Remarkably, integer linear programming and mixed integer programming have been applied to corporate tax structuring, collaborative transportation, inventory management and robot system design, to name but a few (see e.g., Lin & Salkin, 1983;Baca et al, 2014;Guajardo & Rönnqvist, 2015;Guajardo et al, 2018). And, branch and bound-based algorithms have been often used in profit maximization of the production system; customer coalitions in electronic marketplaces to extract group discounts, node coalitions in grid computing for coordinated resources; forming cars to minimize the travel cost of the overall system, tackling social ridesharing problems and so on (see e.g., Sombattheera & Ghose, 2006;Banerjee & Kraemer, 2010;Bistaffa et al, 2015Bistaffa et al, , 2017.…”
Section: Macro Analysismentioning
confidence: 99%
“…Alternatively, we can categorize CSs by the integer partition of n that describes the number of coalitions and their cardinalities. Each instance j of such a partition is known as a "pattern" [24,22] or a "configuration" [10], G j , which is usually written in the form b 1 + . .…”
Section: Optimal Coalition Structurementioning
confidence: 99%