The search session has expired. Please query the service again.

Cœur et nucléolus des jeux de recouvrement

Nicolas Preux; Fatiha Bendali; Jean Mailfert; Alain Quilliot

RAIRO - Operations Research - Recherche Opérationnelle (2000)

  • Volume: 34, Issue: 3, page 363-383
  • ISSN: 0399-0559

How to cite

top

Preux, Nicolas, et al. "Cœur et nucléolus des jeux de recouvrement." RAIRO - Operations Research - Recherche Opérationnelle 34.3 (2000): 363-383. <http://eudml.org/doc/105225>.

@article{Preux2000,
author = {Preux, Nicolas, Bendali, Fatiha, Mailfert, Jean, Quilliot, Alain},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {core; linear integer covering problem; nucleolus; polynomial time; column generation},
language = {fre},
number = {3},
pages = {363-383},
publisher = {EDP-Sciences},
title = {Cœur et nucléolus des jeux de recouvrement},
url = {http://eudml.org/doc/105225},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Preux, Nicolas
AU - Bendali, Fatiha
AU - Mailfert, Jean
AU - Quilliot, Alain
TI - Cœur et nucléolus des jeux de recouvrement
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 3
SP - 363
EP - 383
LA - fre
KW - core; linear integer covering problem; nucleolus; polynomial time; column generation
UR - http://eudml.org/doc/105225
ER -

References

top
  1. 1. P. CHARDAIRE, The core and nucleolus of simple plant location, Technical Report SYS-C95-08. University of East Anglia (1996). 
  2. 2. J. EDMONDS, Optimum branchings. National Bureau of Standards Journal of Research 69 B (1967) 125-130. Zbl0155.51204MR183532
  3. 3. M. GÖTHE-LUNDGREN, K. JÖRNSTEN et P. VÄRBRAND, On the nucleolus of the basics vehicule routing game Math. Programming 27 (1996) 83-100. Zbl0851.90031MR1385165
  4. 4. D. GRANOT, A generalized linear production model: A unifying model. Math. Programming 34 (1986) 212-222. Zbl0604.90142MR838480
  5. 5. M. GROTSCHEL, L. LOVASZ et A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197. Zbl0492.90056MR625550
  6. 6. A. KOPELOWTTZ, Computation of the kernels of simple games and the nucleolus of n-person games, Technical Report RM-31. The Hebrew University of Jerusalem (1967). 
  7. 7. M. MASCHLER, M. PELEG et L.S. SHAPLEY, Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. 4 (1979) 303-338. Zbl0426.90097MR549121
  8. 8. G. OWEN, On the core of linear production games. Math. Programming 9 (1975) 358-370. Zbl0318.90060MR403700
  9. 9. N. PREUX, Tarification, coopération et compétition dans les réseaux de télécommunications, Ph. D. Thesis. Université Blaise Pascal (1999). 
  10. 10. N. PREUX, La théorie des jeux coopératifs : un outil pour l'allocation des coûts dans un réseau, Technical Report NT/DAC/ORI/5026 (1997). 
  11. 11. D. SCHMEIDLER, The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17 (1969) 1163-1170. Zbl0191.49502MR260432
  12. 12. A. TAMIR, On the core of network synthesis games. Math. Programming 50 (1991) 123-135. Zbl0722.90091MR1098852
  13. 13. A. TAMIR, On the core of cost allocation games defined on location problems. Transportation Science 27 (1992) 81-86. Zbl0805.90126MR1208261

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.