


default search action
International Transactions in Operational Research, Volume 18
Volume 18, Number 1, January 2011
- Abdur Rais

, Ana Viana
:
Operations Research in Healthcare: a survey. 1-31 - Leo Liberti

, Carlile Lavor
, Antonio Mucherino
, Nelson Maculan:
Molecular distance geometry methods: from continuous to discrete. 33-51 - Darwish Abdulrahman Yousef:

Operations research/management science in the Arab world: historical development. 53-69 - Aaron Luntala Nsakanda

, Moustapha Diaby, Yuheng Cao:
Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach. 71-86 - Matthew J. Drake

, David W. Pentico:
Price discounts for increased profitability under partial backordering. 87-101 - Rim Kalaï, Daniel Vanderpooten

:
The lexicographic α-robust knapsack problem. 103-113 - Silvio A. de Araujo

, Ademir Aparecido Constantino, Kelly Cristina Poldi:
An evolutionary algorithm for the one-dimensional cutting stock problem. 115-127
Volume 18, Number 2, March 2011
- Bernard Fortz

:
Applications of meta-heuristics to traffic engineering in IP networks. 131-147 - David K. Smith:

A bibliography of applications of operational research in sub-Saharan Africa. 149-182 - António Gaspar-Cunha

, Fernando Mendes, M. Fernanda P. Costa
:
Multi-objective memetic algorithm: comparing artificial neural networks and pattern search filter method approaches. 183-203 - Giovanni Cesaroni

:
A complete FDH efficiency analysis of a diffused production network: the case of the Italian driver and vehicle agency. 205-229 - Chun Hung Cheng

, Kam-Fai Wong
, Kwan-Ho Woo:
An improved branch-and-bound clustering approach for data partitioning. 231-255 - Geraldo Regis Mauri

, Luiz Antonio Nogueira Lorena
:
Lagrangean decompositions for the unconstrained binary quadratic programming problem. 257-270 - Cristina Teixeira, José A. Covas

, Thomas Stützle
, António Gaspar-Cunha
:
Engineering an efficient two-phase local search algorithm for the co-rotating twin-screw extruder configuration problem. 271-291
Volume 18, Number 3, May 2011
- João C. N. Clímaco

, José M. F. Craveirinha
:
On OR-based routing approaches for the Internet. 295-305 - Walid Ben-Ameur, Mateusz Zotkiewicz:

Robust routing and optimal partitioning of a traffic demand polytope. 307-333 - Luis Eduardo Neves Gouveia

, Pedro Patrício
, Amaro de Sousa
:
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. 335-358 - Bernard Fortz

, Hakan Ümit:
Efficient techniques and tools for intra-domain traffic engineering. 359-376 - Andrzej P. Wierzbicki, Wojciech Burakowski

:
A conceptual framework for multiple-criteria routing in QoS IP networks. 377-399 - Roger Reis, Marcus Ritt

, Luciana S. Buriol, Mauricio G. C. Resende:
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. 401-423
Volume 18, Number 4, July 2011
- Marcelo C. Couto, Pedro J. de Rezende, Cid C. de Souza

:
An exact algorithm for minimizing vertex guards on art galleries. 425-448 - Francis J. Vasko, Jeffrey D. Kunkel, Patrick Gorman:

Using an interval graph approach to efficiently solve the housing benefit data retrieval problem. 449-453 - Luis Miguel Torres

, Ramiro Torres, Ralf Borndörfer, Marc E. Pfetsch
:
Line planning on tree networks with applications to the Quito Trolebús system. 455-472 - Jing Chen, Peter C. Bell:

The impact of customer returns on decisions in a newsvendor problem with and without buyback policies. 473-491 - Michael J. Hirsch, Panos M. Pardalos, Mauricio G. C. Resende:

Correspondence of projected 3-D points and lines using a continuous GRASP. 493-511 - Annibal Parracho Sant'Anna

, Valter de Senna, Hernane Borges de Barros Pereira
:
Composition of probabilistic evaluations of preferences: a case of criteria applied to isolated and clustered options. 513-526 - Ioannis Konstantaras

, Konstantina Skouri
:
A note on a production-inventory model under stock-dependent demand, Weibull distribution deterioration, and shortage. 527-531
Volume 18, Number 5, September 2011
- Mohammad Reza Alirezaee, Mohammad-Reza Rafiee Sani:

New analytical hierarchical process/data envelopment analysis methodology for ranking decision-making units. 533-544 - Kostas Kounetas

, Athanasios Anastasiou, Panagiotis Mitropoulos
, Ioannis Mitropoulos
:
Departmental efficiency differences within a Greek university: An application of a DEA and Tobit analysis. 545-559 - Walid Abdul-Kader

, Ozhand Ganjavi, Md. Fazle Baki:
A nonlinear model for optimizing the performance of a multi-product production line. 561-577 - Ke Xu, Wei-yu Kevin Chiang

, Liang Liang:
Dynamic pricing and channel efficiency in the presence of the cost learning effect. 579-604 - Helenice de Oliveira Florentino

, Adriano Dawison De Lima, Lídia Raquel De Carvalho
, Antonio Roberto Balbo
, Thiago Pedro Donadon Homem
:
Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration. 605-615 - Ozgun Caliskan-Demirag:

Optimizing channel profits with threshold incentives and alternative pricing schemes. 617-646
Volume 18, Number 6, November 2011
- Mohammad Dolatabadi, Andrea Lodi, Zahra Afsharnejad:

Improving spectral bounds for clustering problems by Lagrangian relaxation. 647-661 - Fernando Y. Chiyoshi, Reinaldo Morabito

:
A Tabu search algorithm for solving the extended maximal availability location problem. 663-678 - Aletéia P. F. Araújo

, Cristina Boeres, Vinod E. F. Rebello, Celso C. Ribeiro
:
A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications. 679-705 - Renato De Leone

, Paola Festa, Emilia Marchitto:
Solving a bus driver scheduling problem with randomized multistart heuristics. 707-727 - Mohammad Reza Alirezaee, Mohammad-Reza Rafiee Sani:

An enumeration algorithm for integer-valued data envelopment analysis. 729-740 - Reza Kazemi Matin

, Ali Emrouznejad
:
An integer-valued data envelopment analysis model with bounded outputs. 741-749
- Carlile Lavor

, Leo Liberti
, Nelson Maculan:
A note on "A branch-and-prune algorithm for the molecular distance geometry problem". 751-752

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














