![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/rairo/rairo36.bht:"
@article{DBLP:journals/rairo/AbbasC02, author = {Moncef Abbas and Djamal Chaabane}, title = {An Algorithm For Solving Multiple Objective Integer Linear Programming Problem}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {4}, pages = {351--364}, year = {2002}, url = {https://doi.org/10.1051/ro:2003006}, doi = {10.1051/RO:2003006}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/AbbasC02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BampisGK02, author = {Evripidis Bampis and Rodolphe Giroudeau and Jean{-}Claude K{\"{o}}nig}, title = {On the hardness of approximating the {UET-UCT} scheduling problem with hierarchical communications}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {21--36}, year = {2002}, url = {https://doi.org/10.1051/ro:2002003}, doi = {10.1051/RO:2002003}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BampisGK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BlazewiczDD02, author = {Jacek Blazewicz and Paolo Dell'Olmo and Maciej Drozdowski}, title = {Scheduling multiprocessor tasks on two parallel processors}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {37--51}, year = {2002}, url = {https://doi.org/10.1051/ro:2002004}, doi = {10.1051/RO:2002004}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BlazewiczDD02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BlazewiczF02, author = {Jacek Blazewicz and Piotr Formanowicz}, title = {Scheduling jobs in open shops with limited machine availability}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {2}, pages = {149--156}, year = {2002}, url = {https://doi.org/10.1051/ro:2002008}, doi = {10.1051/RO:2002008}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BlazewiczF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BoffeyWPF02, author = {T. Brian Boffey and R. C. Williams and Blas Pelegr{\'{\i}}n and Pascual Fern{\'{a}}ndez}, title = {The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {1--19}, year = {2002}, url = {https://doi.org/10.1051/ro:2002002}, doi = {10.1051/RO:2002002}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BoffeyWPF02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/BykadorovEM02, author = {Igor A. Bykadorov and Andrea Ellero and Elena Moretti}, title = {Minimization of communication expenditure for seasonal products}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {2}, pages = {109--127}, year = {2002}, url = {https://doi.org/10.1051/ro:2002012}, doi = {10.1051/RO:2002012}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/BykadorovEM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/DemangeP02, author = {Marc Demange and Vangelis Th. Paschos}, title = {Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifi{\'{e}} et classes d'approximation}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {3}, pages = {237--277}, year = {2002}, url = {https://doi.org/10.1051/ro:2003005}, doi = {10.1051/RO:2003005}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/DemangeP02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/DemangeP02a, author = {Marc Demange and Vangelis Th. Paschos}, title = {Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de {NPO} {\`{a}} la structure des instances}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {4}, pages = {311--350}, year = {2002}, url = {https://doi.org/10.1051/ro:2003009}, doi = {10.1051/RO:2003009}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/DemangeP02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Derbala02, author = {Ali Derbala}, title = {Un ordonnancement dynamique de t{\^{a}}ches stochastiques sur un seul processeur}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {4}, pages = {365--373}, year = {2002}, url = {https://doi.org/10.1051/ro:2003010}, doi = {10.1051/RO:2003010}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Derbala02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Djellab02, author = {Natalia V. Djellab}, title = {On the {M/G/1} retrial queue subjected to breakdowns}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {4}, pages = {299--310}, year = {2002}, url = {https://doi.org/10.1051/ro:2003007}, doi = {10.1051/RO:2003007}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Djellab02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/GetachewK02, author = {Teodros Getachew and Michael M. Kostreva}, title = {A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {3}, pages = {175--190}, year = {2002}, url = {https://doi.org/10.1051/ro:2003001}, doi = {10.1051/RO:2003001}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/GetachewK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Giannessi02, author = {Franco Giannessi}, title = {Technical comment. {A} problem on Markov chains}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {2}, pages = {173}, year = {2002}, url = {https://doi.org/10.1051/ro:2002011}, doi = {10.1051/RO:2002011}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Giannessi02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/HaqiqLMO02, author = {Abdelkrim Haqiq and Ioannis Lambadaris and Noufissa Mikou and Luis Orozco{-}Barbosa}, title = {Optimal QoS control of interacting service stations}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {3}, pages = {191--208}, year = {2002}, url = {https://doi.org/10.1051/ro:2003002}, doi = {10.1051/RO:2003002}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rairo/HaqiqLMO02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Kadhi02, author = {Fethi Kadhi}, title = {Generalized Characterization of the Convex Envelope of a Function}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {95--100}, year = {2002}, url = {https://doi.org/10.1051/ro:2002007}, doi = {10.1051/RO:2002007}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Kadhi02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/KovalevaS02, author = {Sofia Kovaleva and Frits C. R. Spieksma}, title = {Primal-dual approximation algorithms for a packing-covering pair of problems}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {53--71}, year = {2002}, url = {https://doi.org/10.1051/ro:2002005}, doi = {10.1051/RO:2002005}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/KovalevaS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Mastroeni02, author = {Giandomenico Mastroeni}, title = {A Markov chain model for traffic equilibrium problems}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {3}, pages = {209--226}, year = {2002}, url = {https://doi.org/10.1051/ro:2003003}, doi = {10.1051/RO:2003003}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Mastroeni02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Monnot02, author = {J{\'{e}}r{\^{o}}me Monnot}, title = {Differential approximation of NP-hard problems with equal size feasible solutions}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {4}, pages = {279--297}, year = {2002}, url = {https://doi.org/10.1051/ro:2003008}, doi = {10.1051/RO:2003008}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Monnot02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/OkamuraMD02, author = {Hiroyuki Okamura and Satoshi Miyahara and Tadashi Dohi}, title = {Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {2}, pages = {129--148}, year = {2002}, url = {https://doi.org/10.1051/ro:2002010}, doi = {10.1051/RO:2002010}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/OkamuraMD02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Petitjean02, author = {Michel Petitjean}, title = {Agr{\'{e}}gation des similarit{\'{e}}s : une solution oubli{\'{e}}e}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {101--108}, year = {2002}, url = {https://doi.org/10.1051/ro:2002001}, doi = {10.1051/RO:2002001}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Petitjean02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/QianPN02, author = {Cunhua Qian and Yu Pan and Toshio Nakagawa}, title = {Optimal Policies for a Database System with Two Backup Schemes}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {3}, pages = {227--235}, year = {2002}, url = {https://doi.org/10.1051/ro:2003004}, doi = {10.1051/RO:2003004}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/QianPN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/Roubi02, author = {Ahmed Roubi}, title = {Convergence of Prox-Regularization Methods for Generalized Fractional Programming}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {1}, pages = {73--94}, year = {2002}, url = {https://doi.org/10.1051/ro:2002006}, doi = {10.1051/RO:2002006}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/Roubi02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rairo/SandohL02, author = {Hiroaki Sandoh and Roy Larke}, title = {A Theoretical Model for Testing New Product Sales Velocity at Small Format Retail Stores}, journal = {{RAIRO} Oper. Res.}, volume = {36}, number = {2}, pages = {157--172}, year = {2002}, url = {https://doi.org/10.1051/ro:2002009}, doi = {10.1051/RO:2002009}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rairo/SandohL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.