Narrow your search

Library

AP (1)

EhB (1)

KDG (1)

KU Leuven (1)

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLouvain (1)

UCLL (1)

More...

Resource type

book (2)

digital (1)


Language

English (3)


Year
From To Submit

2010 (3)

Listing 1 - 3 of 3
Sort by

Book
Cooperative lot sizing games in supply chains
Author:
ISBN: 9783642137259 9783642137242 3642137245 Year: 2010 Volume: 644 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations.


Book
Cooperative lot sizing games in supply chains
Author:
ISBN: 3642137245 9786612925214 3642137253 1282925210 Year: 2010 Publisher: Heidelberg ; New York : Springer Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations.


Digital
Cooperative Lot Sizing Games in Supply Chains
Author:
ISBN: 9783642137259 9783642137242 9783642137266 Year: 2010 Publisher: Berlin, Heidelberg Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations.

Listing 1 - 3 of 3
Sort by