default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 31 matches
- 2020
- Nasr Al-Hinai, Chefi Triki:
A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice. Ann. Oper. Res. 286(1): 325-350 (2020) - Víctor M. Albornoz, Marcelo I. Véliz, Rodrigo Ortega, Virna Ortíz-Araya:
Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty. Ann. Oper. Res. 286(1): 617-634 (2020) - Eduardo Álvarez-Miranda, John Díaz-Guerrero:
Multicriteria saliency detection: a (exact) robust network design approach. Ann. Oper. Res. 286(1): 649-668 (2020) - Rafael Castro de Andrade, Rommel Dias Saraiva:
MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles. Ann. Oper. Res. 286(1): 147-172 (2020) - Sebastián Arpón, Tito Homem-de-Mello, Bernardo K. Pagnoncelli:
An ADMM algorithm for two-stage stochastic programming problems. Ann. Oper. Res. 286(1): 559-582 (2020) - Igor Averbakh, Wei Yu:
Multi-depot traveling salesmen location problems on networks with special structure. Ann. Oper. Res. 286(1): 635-648 (2020) - Javiera Barrera, Rodrigo A. Carrasco, Susana V. Mondschein, Gianpiero Canessa, David Rojas-Zalazar:
Operating room scheduling under waiting time constraints: the Chilean GES plan. Ann. Oper. Res. 286(1): 501-527 (2020) - Javiera Barrera, Eduardo Moreno, Sebastián Varas K.:
A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case. Ann. Oper. Res. 286(1): 545-557 (2020) - Fabrizio Borghini, Isabel Méndez-Díaz, Paula Zabala:
An exact algorithm for the edge coloring by total labeling problem. Ann. Oper. Res. 286(1): 11-31 (2020) - Manoel B. Campêlo, Tatiane Fernandes Figueiredo, Ana Silva:
The sociotechnical teams formation problem: a mathematical optimization approach. Ann. Oper. Res. 286(1): 201-216 (2020) - Alejandro Mac Cawley, Maximiliano Cubillos, Rodrigo Pascual:
A real options approach for joint overhaul and replacement strategies with mean reverting prices. Ann. Oper. Res. 286(1): 303-324 (2020) - Sebastián Cea-Echenique, Guillermo Durán, Mario Guajardo, Denis Sauré, Joaquín Siebert, Gonzalo Andres Zamorano:
An analytics approach to the FIFA ranking procedure and the World Cup final draw. Ann. Oper. Res. 286(1): 119-146 (2020) - Leonardo Tomazeli Duarte, Alex Pincelli Mussio, Cristiano Torezzan:
Dealing with missing information in data envelopment analysis by means of low-rank matrix completion. Ann. Oper. Res. 286(1): 719-732 (2020) - Guillermo Durán, Martín D. Safe, Xavier S. Warnes:
Neighborhood covering and independence on P4-tidy graphs and tree-cographs. Ann. Oper. Res. 286(1): 55-86 (2020) - Leonardo D. Epstein, Eduardo González, Abdón Sepúlveda:
Optimal size of a rental inventory with items available from a secondary source: a model with non-stationary probabilities. Ann. Oper. Res. 286(1): 371-390 (2020) - John E. Fontecha, Oscar O. Guaje, Daniel Duque, Raha Akhavan-Tabatabaei, Juan Pablo Rodríguez, Andrés L. Medaglia:
Combined maintenance and routing optimization for large-scale sewage cleaning. Ann. Oper. Res. 286(1): 441-474 (2020) - Monique Guignard:
Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints. Ann. Oper. Res. 286(1): 173-200 (2020) - Laura Hervert-Escobar, Jesús Fabián López Pérez:
Production planning and scheduling optimization model: a case of study for a glass container company. Ann. Oper. Res. 286(1): 529-543 (2020) - Juri Hinz, Tanya Tarnopolskaya, Jeremy Yee:
Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations. Ann. Oper. Res. 286(1): 583-615 (2020) - Thiago Cantos Lopes, Celso Gustavo Stall Sikora, Adalberto Sato Michels, Leandro Magatão:
Mixed-model assembly lines balancing with given buffers and product sequence: model, formulation comparisons, and case study. Ann. Oper. Res. 286(1): 475-500 (2020) - Sergio Maturana, Roger Z. Ríos-Mercado, Jorge R. Vera:
Preface: Introducing operations research trends at CLAIO XVIII. Ann. Oper. Res. 286(1): 1-9 (2020) - Wendel Melo, Marcia Fampa, Fernanda M. P. Raupp:
An overview of MINLP algorithms and their implementation in Muriqui Optimizer. Ann. Oper. Res. 286(1): 217-241 (2020) - Sebastián Moreno, Jordi Pereira, Wilfredo F. Yushimito:
A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution. Ann. Oper. Res. 286(1): 87-117 (2020) - Tatsushi Nishi, Tatsuya Okura, Eduardo Lalla-Ruiz, Stefan Voß:
A dynamic programming-based matheuristic for the dynamic berth allocation problem. Ann. Oper. Res. 286(1): 391-410 (2020) - Amir Hossein Nobil, Amir Hosein Afshar Sedigh, Leopoldo Eduardo Cárdenas-Barrón:
A multiproduct single machine economic production quantity (EPQ) inventory model with discrete delivery order, joint production policy and budget constraints. Ann. Oper. Res. 286(1): 265-301 (2020) - Camila Ramos, Alejandro Cataldo, Juan-Carlos Ferrer:
Appointment and patient scheduling in chemotherapy: a case study in Chilean hospitals. Ann. Oper. Res. 286(1): 411-439 (2020) - Luis Augusto San-José, Joaquín Sicilia, Manuel González-de La Rosa, Jaime Febles-Acosta:
Best pricing and optimal policy for an inventory system under time-and-price-dependent demand and backordering. Ann. Oper. Res. 286(1): 351-369 (2020) - José A. Santiváñez, Emanuel Melachrinoudis:
Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions. Ann. Oper. Res. 286(1): 669-701 (2020) - André Renato Villela da Silva, Luiz Satoru Ochi, Bruno José da Silva Barros, Rian Gabriel S. Pinheiro:
Efficient approaches for the Flooding Problem on graphs. Ann. Oper. Res. 286(1): 33-54 (2020) - Marielena Fonseca Tófoli, Edilaine Martins Soler, Antonio Roberto Balbo, Edméa Cássia Baptista, Leonardo Nepomuceno:
Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables. Ann. Oper. Res. 286(1): 243-263 (2020)
skipping 1 more match
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-21 20:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint