Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Operations Research, Volume 45
Volume 45, Number 1, January 2011
- Faouzi Ben Charrada, Sana Ezouaoui, Zaher Mahjoub:
Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices. 1-16 - Moshe Haviv, Rita Zlotnikov:
Computational schemes for two exponential servers where the first has a finite buffer. 17-36 - Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche
, Frédéric Meunier, Ludovic Robinet:
Balancing the stations of a self service "bike hire" system. 37-61 - Alireza Amirteimoori, Ali Emrouznejad:
Flexible measures in production process: A DEA-based approach. 63-74
Volume 45, Number 2, April 2011
- Luis A. A. Meira, Flávio Keidi Miyazawa:
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem. 75-100 - Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan:
Minmax regret combinatorial optimization problems: an Algorithmic Perspective. 101-129 - Muthukrishnan Senthil Kumar:
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service. 131-152 - Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen:
A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components. 153-178
Volume 45, Number 3, July 2011
- Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint:
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. 179-207 - Marina Groshaus, Jayme Luiz Szwarcfiter:
Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . 209-222 - Amit Choudhury, Medhi Pallabi:
Some aspects of balking and reneging in finite buffer queues. 223-240 - Nicolas Boria, Vangelis Th. Paschos:
A survey on combinatorial optimization in dynamic environments. 241-294
Volume 45, Number 4, October 2011
- Josep Freixas, Xavier Molinero, Martin Olsen, Maria J. Serna:
On the complexity of problems on simple games. 295-314 - Laureano Fernando Escudero Bueno, Susana Muñoz:
On designing connected rapid transit networks reducing the number of transfers. 315-338 - Philippe Gambette, Alain Guénoche:
Bootstrap clustering for graph partitioning. 339-352 - Hasan Murat Afsar, Nicolas Jozefowiez, Pierre Lopez:
A branch-and-price algorithm for the windy rural postman problem. 353-364
a service of 
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.
last updated on 2024-04-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
