Остановите войну!
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 755 matches
- 2024
- A. Baskar, M. A. Sai Balaji, Jitendra Kumar Katiyar, Bharti Nagpal, J. Rajesh Babu:
New population-based simple algorithms for solving global optimisation problems. Int. J. Math. Oper. Res. 27(2): 199-222 (2024) - Faizan Danish, S. E. H. Rizvi:
Approximately optimum strata boundaries under super population model. Int. J. Math. Oper. Res. 27(1): 63-74 (2024) - Chaitali Kar, Manoranjan De, Manoranjan Maiti, Pritha Das:
Multi-objective perishable multi-item green inventory models with uncertain finite time horizons and constraints by neutrosophic optimisation approach. Int. J. Math. Oper. Res. 27(2): 167-198 (2024) - V. Karthick, V. Suvitha, Rathinasabapathy Kalyanaraman:
A single server Markovian differentiated working vacation queue with server breakdown. Int. J. Math. Oper. Res. 27(1): 105-120 (2024) - Gautam Kumar, Sukhendu Bera, Guruprasad P. Samanta, Manoranjan Maiti:
Optimal order quantity and credit period for a time-dependent deteriorated green item under two-level trade credit with reminder cost: a new approach. Int. J. Math. Oper. Res. 27(1): 75-104 (2024) - Gomolemo Jacqueline Lekono, Broderick O. Oluyede, Lesego Gabaitiri:
A new heavy-tailed exponentiated generalised-G family of distributions: properties and applications. Int. J. Math. Oper. Res. 27(1): 1-34 (2024) - Shirsendu Nandi:
Risk analysis on product quality improvement and supply chain performance for return contract with warranty. Int. J. Math. Oper. Res. 27(1): 121-143 (2024) - Itishree Rout, Trailokyanath Singh, Ameeya Kumar Nayak:
An EOQ inventory policy varying with exponential-constant-exponential demand and shortages. Int. J. Math. Oper. Res. 27(2): 145-166 (2024) - K. Preethi Sowndharya, J. Ebenesar Anna Bagyam:
Optimal server analysis of M/M/c queueing model to reduce the waiting time of patients in healthcare service. Int. J. Math. Oper. Res. 27(2): 254-266 (2024) - Aniket Todkar, Jayesh M. Dhodiya:
Aspiration level-based non-dominated sorting genetic algorithm-II and III for multi-objective shortest path problem in a trapezoidal environment. Int. J. Math. Oper. Res. 27(2): 223-253 (2024) - Ibrahim Yusuf, Muhammad Sagir Aliyu, Mus'abu Musa:
Mean time to failure modelling and sensitivity analysis of mixed standby serial systems. Int. J. Math. Oper. Res. 27(2): 267-289 (2024) - Ibrahim Yusuf, Muhammad Kabeer:
RAMD approach to performance estimation of fog-to-fog collaboration using software-defined networking. Int. J. Math. Oper. Res. 27(1): 35-62 (2024) - 2023
- Babiker Ibrahim Abdelfadil, Lamay Bin Sabir, Mohd. Nishat Faisal:
Determinants of red meat consumption in Qatar: implications for red meat supply chains. Int. J. Math. Oper. Res. 25(2): 161-185 (2023) - Emmanuel Oluseye Adeyefa, Ezekiel Olaoluwa Omole:
A continuous five-step implicit block unification method for numerical solution of second-order elliptic partial differential equations. Int. J. Math. Oper. Res. 24(3): 360-386 (2023) - Radhika Agarwal, Divya Agarwal, Shweta Upadhyaya:
Cost optimisation of a heterogeneous server queueing system with working breakdown using PSO. Int. J. Math. Oper. Res. 26(3): 410-424 (2023) - Anu G. Aggarwal, Sudeep Kumar, Ritu Gupta:
Multi-release software reliability assessment: testing coverage-based approach. Int. J. Math. Oper. Res. 24(4): 583-594 (2023) - Eshika Aggarwal, Bhaba Krishna Mohanty:
Hesitant fuzzy sets with non-uniform linguistic terms: an application in multi-attribute decision making. Int. J. Math. Oper. Res. 24(1): 1-28 (2023) - Mohammad Subhi Al-Batah, Mohammed Riyad Al-Eiadeh:
An improved discreet Jaya optimisation algorithm with mutation operator and opposition-based learning to solve the 0-1 knapsack problem. Int. J. Math. Oper. Res. 26(2): 143-169 (2023) - Tadeusz Antczak, Kalpana Shukla:
Local cone approximations in non-smooth K-univex multi-objective programming problems. Int. J. Math. Oper. Res. 26(4): 425-448 (2023) - Aghiles Azizen, Kahina Louadj, Mohamed Aidène:
An algorithm for solving a min-max problem by adaptive method. Int. J. Math. Oper. Res. 26(1): 96-110 (2023) - Adlane Baaziz, Hacène Aït Haddadène, Ammar Oulamara, Ahmed Kouider:
Scheduling preemptive jobs on parallel machines with a conflict graph: a graph multi-colouring approach. Int. J. Math. Oper. Res. 25(1): 47-67 (2023) - J. Ebenesar Anna Bagyam, P. Suganthi, P. Visali:
Unreliable single server retrial queueing model with repeated vacation. Int. J. Math. Oper. Res. 26(3): 357-372 (2023) - Ziyad Bahou, Issam Krimi, Abdessamad Ait El Cadi, Nizar El Hachemi:
Availability modelling and analysis of a two-component parallel system under stochastic dependence. Int. J. Math. Oper. Res. 26(3): 327-356 (2023) - Mona Bahrami, Mehdi Seifbarghy, Mohsen Hamidi, Farshad Faghihzade:
Comparing different types of robust possibilistic programming approaches in designing closed-loop networks. Int. J. Math. Oper. Res. 25(4): 463-491 (2023) - Kulanthaivel Balakrishnan, R. Dhanalakshmi:
Classification and feature selection for microarray cancer dataset using an improved African vulture optimisation algorithm. Int. J. Math. Oper. Res. 26(1): 1-18 (2023) - Tuhin Bera, Nirmal Kumar Mahapatra:
A distinct management of linear programming in uncertain atmosphere. Int. J. Math. Oper. Res. 26(2): 182-199 (2023) - Amrita Bhadoriya, Mrudul Y. Jani, Santosh Kumar Sharma, Urmila Chaudhari:
Impact of advertisements on retailer's inventory for time-varying perishable rate with preservation technology investment under customer return and trade credit policy. Int. J. Math. Oper. Res. 25(1): 23-46 (2023) - Shashi Bhushan, Anoop Kumar:
New efficient class of estimators of population mean using two-phase sampling. Int. J. Math. Oper. Res. 24(2): 155-172 (2023) - Murat Cal, Senol Altan:
A greedy heuristic and a lower bound on a nonlinear stochastic TSP with partially satisfied node demand coverage constraint. Int. J. Math. Oper. Res. 26(3): 308-326 (2023) - Satyajit Das, Amrita De:
Weight computation of criteria in a decision-making problem by entropy measure under interval-valued fuzzy environment. Int. J. Math. Oper. Res. 24(2): 194-209 (2023)
skipping 725 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-04-24 15:23 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