Остановите войну!
for scientists:
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 121 matches
- 2019
- Sepideh Abolghasem, Felipe Solano, Claudia D. Bedoya, Lina P. Navas, Ana Paola Ríos, Edwin A. Pinzón, Andrés L. Medaglia, Olga L. Sarmiento:
A robust DEA-centric location-based decision support system for expanding Recreovía hubs in the city of Bogotá (Colombia). Int. Trans. Oper. Res. 26(4): 1157-1187 (2019) - Bernardo F. Almeida, Isabel Correia, Francisco Saldanha-da-Gama:
Modeling frameworks for the multi-skill resource-constrained project scheduling problem: a theoretical and empirical comparison. Int. Trans. Oper. Res. 26(3): 946-967 (2019) - Eduardo Álvarez-Miranda, Markus Sinnl:
A note on computational aspects of the Steiner traveling salesman problem. Int. Trans. Oper. Res. 26(4): 1396-1401 (2019) - Simon Anastasiadis, Stefanka S. Chukova:
An inertia model for the adoption of new farming practices. Int. Trans. Oper. Res. 26(2): 667-685 (2019) - Tadeusz Antczak:
Exactness of the absolute value penalty function method for nonsmooth -invex optimization problems. Int. Trans. Oper. Res. 26(4): 1504-1526 (2019) - Manuel Aprile, Natalia Castro, Graciela Ferreira, Juan Piccini, Franco Robledo, Pablo Romero:
Graph fragmentation problem: analysis and synthesis. Int. Trans. Oper. Res. 26(1): 41-53 (2019) - Ezzatollah Asgharizadeh, Mohammad Reza Taghizadeh Yazdi, Abdolkarim Mohammadi Balani:
An output-oriented classification of multiple attribute decision-making techniques based on fuzzy c-means clustering method. Int. Trans. Oper. Res. 26(6): 2476-2493 (2019) - Naeem Bajwa, Sharif H. Melouk, Paul Bryant:
A hybrid heuristic approach to minimize number of tardy jobs in group technology systems. Int. Trans. Oper. Res. 26(5): 1847-1867 (2019) - Alejandro Balbás, José Garrido, Ramin Okhrati:
Good deal indices in asset pricing: actuarial and financial implications. Int. Trans. Oper. Res. 26(4): 1475-1503 (2019) - Franco Basso, Sophie D'Amours, Mikael Rönnqvist, Andrés Weintraub:
A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics. Int. Trans. Oper. Res. 26(3): 775-793 (2019) - Javier Belloso, Angel A. Juan, Javier Faulin:
An iterative biased-randomized heuristic for the fleet size and mix vehicle-routing problem with backhauls. Int. Trans. Oper. Res. 26(1): 289-301 (2019) - Augusto Bordini, Fábio Protti, Thiago Gouveia da Silva, Gilberto Farias de Sousa Filho:
New algorithms for the minimum coloring cut problem. Int. Trans. Oper. Res. 26(5): 1868-1883 (2019) - Mauricio Bravo, Lorena Pradenas, Víctor Parada:
An evolutionary algorithm for the multi-objective pick-up and delivery pollution-routing problem. Int. Trans. Oper. Res. 26(1): 302-317 (2019) - Rui Pedro Brito, Hélder Sebastião, Pedro Godinho:
Portfolio management with higher moments: the cardinality impact. Int. Trans. Oper. Res. 26(6): 2531-2560 (2019) - Laura Calvet, Dandan Wang, Angel A. Juan, Lluc Bové:
Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands. Int. Trans. Oper. Res. 26(2): 458-484 (2019) - Luciana Casacio, Christiano Lyra, Aurelio R. L. Oliveira:
Interior point methods for power flow optimization with security constraints. Int. Trans. Oper. Res. 26(1): 364-378 (2019) - Giuseppe Catalano, Cinzia Daraio, Marco Diana, Martina Gregori, Giorgio Matteucci:
Efficiency, effectiveness, and impacts assessment in the rail transport sector: a state-of-the-art critical analysis of current research. Int. Trans. Oper. Res. 26(1): 5-40 (2019) - Punya Chatterjee, Salma Karray, Simon Pierre Sigué:
Cooperative advertising programs: are accrual constraints necessary? Int. Trans. Oper. Res. 26(6): 2230-2247 (2019) - Yan Chen, Xiang Song, Djamila Ouelhadj, Yaodong Cui:
A heuristic for the skiving and cutting stock problem in paper and plastic film industries. Int. Trans. Oper. Res. 26(1): 157-179 (2019) - Glaubos Clímaco, Isabel Rosseti, Luidi Simonetti, Marcos A. Guerine:
Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem. Int. Trans. Oper. Res. 26(2): 615-641 (2019) - Ana Sara Costa, José Rui Figueira, Carlos Rodrigues Vieira, Isabel Viegas Vieira:
An application of the ELECTRE TRI-C method to characterize government performance in OECD countries. Int. Trans. Oper. Res. 26(5): 1935-1955 (2019) - Pavlos Delias, Michael Doumpos, Evangelos Grigoroudis, Nikolaos F. Matsatsinis:
A non-compensatory approach for trace clustering. Int. Trans. Oper. Res. 26(5): 1828-1846 (2019) - Derya Deliktas, Orhan Torkul, Ozden Ustun:
A flexible job shop cell scheduling with sequence-dependent family setup times and intercellular transportation times using conic scalarization method. Int. Trans. Oper. Res. 26(6): 2410-2431 (2019) - Victor Eduardo Leite de Almeida Duca, Reinaldo Castro Souza, Pedro Guilherme Costa Ferreira, Fernando Luiz Cyrino Oliveira:
Simulation of time series using periodic gamma autoregressive models. Int. Trans. Oper. Res. 26(4): 1315-1338 (2019) - Maryam Eghbali-Zarch, Ata Allah Taleizadeh, Reza Tavakkoli-Moghaddam:
Pricing decisions in a multiechelon supply chain under a bundling strategy. Int. Trans. Oper. Res. 26(6): 2096-2128 (2019) - Shakiba Enayati, Maria E. Mayorga, Hector Toro-Díaz, Laura A. Albert:
Identifying trade-offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances. Int. Trans. Oper. Res. 26(2): 415-438 (2019) - Alejandro Estrada-Moreno, Christian Fikar, Angel A. Juan, Patrick Hirsch:
A biased-randomized algorithm for redistribution of perishable food inventories in supermarket chains. Int. Trans. Oper. Res. 26(6): 2077-2095 (2019) - Alejandro Estrada-Moreno, Martin W. P. Savelsbergh, Angel A. Juan, Javier Panadero:
Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. Int. Trans. Oper. Res. 26(4): 1293-1314 (2019) - Farshid Evazabadian, Meysam Arvan, Reza Ghodsi:
Short-term crude oil scheduling with preventive maintenance operations: a fuzzy stochastic programming approach. Int. Trans. Oper. Res. 26(6): 2450-2475 (2019) - Amir Farshbaf-Geranmayeh, Masoud Rabbani, Ata Allah Taleizadeh:
Cooperative advertising to induce strategic customers for purchase at the full price. Int. Trans. Oper. Res. 26(6): 2248-2280 (2019)
skipping 91 more matches
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-06-20 03:19 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