Bibliography

  1. [ANS 12] Anstreicher K., “Interior-point algorithms for a generalization of linear programming and weighted centering”, Optimization Methods and Software, vol. 27, nos. 4–5, pp. 605-612, 2012.
  2. [AUM 74] Aumann R., Dreze J., “Cooperative games with coalition structures”, International Journal of Game Theory, Physica-Verlag, vol. 3, no. 4, pp. 217–237, 1974.
  3. [BEA 08] Beal S., Durieu J., Solal P., “Farsighted coalitional stability in TU-games”, Mathematical Social Sciences, vol. 56, no. 3, pp. 303–313, 2008.
  4. [BEL 06] Belmonte M.-V., Conejo R., de-la Cruz J.-L.P. et al., “Coalitions among intelligent agents: a tractable case”, Computational Intelligence, vol. 22, no. 1, pp. 52–68, 2006.
  5. [BEN 15] Ben Jouida S., Ouni A., Krichen S., “A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict”, Modeling, Computation and Optimization in Information Systems and Management Sciences, Springer International Publishing, vol. 360, pp. 117–128, 2015.
  6. [BER 11] Berman O., Drezner Z., Krass D., “Discrete cooperative covering problems”, Journal of the Operational Research Society, vol. 62, no. 11, pp. 2002–2012, 2011.
  7. [BLO 96] Bloch F., “Sequential formation of coalitions in games with externalities and fixed payoff division”, Games and Economic Behavior, vol. 14, no. 1, pp. 90–123, 1996.
  8. [BRA 07] Brandenburger A., “The power of paradox: some recent developments in interactive epistemology”, International Journal of Game Theory, vol. 35, no. 4, pp. ...

Get Supply Chain Management and its Applications in Computer Science now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.