default search action
Annals of Operations Research, Volume 258
Volume 258, Number 1, November 2017
- Erik Kropat, Ruben A. Tikidji-Hamburyan, Gerhard-Wilhelm Weber:
Operations research in neuroscience. 1-4 - Eduardo Álvarez-Miranda, Hesso Farhan, Martin Luipersbeck, Markus Sinnl:
A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death. 5-30 - Alper Çevik, Gerhard-Wilhelm Weber, B. Murat Eyüboglu, Kader Karli Oguz:
Voxel-MARS: a method for early detection of Alzheimer's disease by classification of structural brain MRI. 31-57 - Ye Rim Choi, Jonghun Park, Dongmin Shin:
A semi-supervised inattention detection method using biological signal. 59-78 - Bülent Karasözen, Tugba Küçükseyhan, Murat Uzunca:
Structure preserving integration and model order reduction of skew-gradient reaction-diffusion systems. 79-106 - Eiji Mizutani, Stuart E. Dreyfus:
Totally model-free actor-critic recurrent neural-network reinforcement learning in non-Markovian domains. 107-131 - V. Rasoulzadeh, E. C. Erkus, T. A. Yogurt, Ilkay Ulusoy, S. Aykan Zergeroglu:
A comparative stationarity analysis of EEG signals. 133-157 - Mustafa Sayli, Enes Yilmaz:
Anti-periodic solutions for state-dependent impulsive recurrent neural networks with time-varying and continuously distributed delays. 159-185
Volume 258, Number 2, November 2017
- Roger Z. Ríos-Mercado, José Luis González Velarde, Manuel Laguna:
Operations research at CLAIO XVII (ALIO/SMIO Joint International Meeting). 187-193 - Adrian Ramirez Nafarrate, Rosa G. González-Ramírez, Neale R. Smith, Roberto Guerra-Olivares, Stefan Voß:
Impact on yard efficiency of a truck appointment system for a port terminal. 195-216 - Cristian Zambrano, Yris Olaya:
An agent-based simulation approach to congestion management for the Colombian electricity market. 217-236 - Cen Song, Jun Zhuang:
Two-stage security screening strategies in the face of strategic applicants, congestions and screening errors. 237-262 - S. R. Chakravarthy, Arunava Maity, U. C. Gupta:
An '(s, S)' inventory in a queueing system with batch service facility. 263-283 - Wei Zhou, Selwyn Piramuthu:
Identification shrinkage in inventory management: an RFID-based solution. 285-300 - José Luis Andrade-Pineda, David Canca, Pedro L. Gonzalez-R:
On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization. 301-346 - Yan Zhang, Juan Li, Qinglong Gou:
An allocation game model with reciprocal behavior and its applications in supply chain pricing decisions. 347-368 - Alejandro Cataldo, Juan-Carlos Ferrer, Jaime Miranda, Pablo A. Rey, Antoine Sauré:
An integer programming approach to curriculum-based examination timetabling. 369-393 - Guillermo Durán, Pablo A. Rey, Patricio Wolff:
Solving the operating room scheduling problem with prioritized lists of patients. 395-414 - Yanina Fumero, Gabriela Corsano, Jorge M. Montagna:
An MILP model for planning of batch plants operating in a campaign-mode. 415-435 - Barbara Gladysz:
Fuzzy-probabilistic PERT. 437-452 - Teresa Neto, Miguel Constantino, Isabel Martins, João Pedro Pedroso:
Forest harvest scheduling with clearcut and core area constraints. 453-478 - Bernardo K. Pagnoncelli, Adriana Piazza:
The optimal harvesting problem under price uncertainty: the risk averse case. 479-502 - Pamela J. Palomo-Martínez, M. Angélica Salazar-Aguilar, Víctor M. Albornoz:
Formulations for the orienteering problem with additional constraints. 503-545 - Luis Cadarso, Ángel Marín:
Improved rapid transit network design model: considering transfer effects. 547-567 - Flavia Bonomo, Jaime Catalán, Guillermo Durán, Rafael Epstein, Mario Guajardo, Alexis Jawtuschenko, Javier Marenco:
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools. 569-585 - Alberto Ferrer, Miguel A. Goberna, E. González-Gutiérrez, Maxim I. Todorov:
A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem. 587-612 - Juan A. Díaz, Dolores E. Luna:
Primal and dual bounds for the vertex p-median problem with balance constraints. 613-638 - Zvi Drezner, Saïd Salhi:
Incorporating neighborhood reduction for the solution of the planar p-median problem. 639-654 - Iván A. Contreras, Moayad Tanash, Navneet Vidyarthi:
Exact and heuristic approaches for the cycle hub location problem. 655-677 - Ramon Auad, Rajan Batta:
Location-coverage models for preventing attacks on interurban transportation networks. 679-717 - Alyne Toscano, Socorro Rangel, Horacio Hideki Yanasse:
A heuristic approach to minimize the number of saw cycles in small-scale furniture factories. 719-746 - Francisco Trespalacios, Ignacio E. Grossmann:
Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem. 747-759 - David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte:
The multi-vehicle cumulative covering tour problem. 761-780 - Gilberto Farias de Sousa Filho, Teobaldo L. Bulhões Júnior, Lucídio dos Anjos F. Cabral, Luiz Satoru Ochi, Fábio Protti:
New heuristics for the Bicluster Editing Problem. 781-814 - Laura Hervert-Escobar, Neale R. Smith, Timothy I. Matis, César Vargas Rosales:
Optimal location of RFID reader antennas in a three dimensional space. 815-823 - Jésica de Armas, Luis Cadarso, Angel A. Juan, Javier Faulin:
A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals. 825-848 - Leonardo Riegel Sant'Anna, Tiago Pascoal Filomena, Pablo Cristini Guedes, Denis Borenstein:
Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming. 849-867 - Yamisleydi Salgueiro, Jorge L. Toro, Rafael Bello, Rafael Falcon:
Multiobjective variable mesh optimization. 869-893
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.