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 780 matches
- 2024
- Qusay Mohammed Abdulateef, Syariza Abdul-Rahman, Hazem Sabri Abedalhammed:
Cyprinus carpio feed cost optimisation using the linear programming technique: a case study in Iraq. Int. J. Math. Oper. Res. 27(3): 377-392 (2024) - Luay Aljasim, Ferhan Al-Maliky:
Sensitivity analysis of the optimum solution to perturbations of the profit of an item in the multiple-choice knapsack problem. Int. J. Math. Oper. Res. 28(2): 147-162 (2024) - C. K. Anjali, Sreekanth Kolledath:
Survey on queuing models with discouragement, policies and vacation. Int. J. Math. Oper. Res. 28(1): 105-145 (2024) - G. Ayyappan, G. Archana Alias Gurulakshmi:
Analysis of MAP/PH/1 queue with differentiated vacation, vacation interruption under N-policy, optional service, breakdown, repair, setup and discouragement of customers. Int. J. Math. Oper. Res. 27(4): 415-457 (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) - Ankan Bose, Dipak Laha:
Efficient clustering-based constructive heuristics for capacitated vehicle routing. Int. J. Math. Oper. Res. 27(4): 458-478 (2024) - Meryem Cheraitia, Rewayda Razaq Abo-Alsabeh:
A hybrid modified cuckoo search algorithm for the uncapacitated examination timetabling. Int. J. Math. Oper. Res. 28(1): 40-59 (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) - Riya Dutta, Prasun Kumar Nayak:
Ekeland variational principle on intuitionistic fuzzy quasi metric spaces. Int. J. Math. Oper. Res. 28(1): 1-17 (2024) - Abhinav Goel, Anshika Singh:
Decaying inventory model with different rates and varying costs under preservation technology investment. Int. J. Math. Oper. Res. 28(2): 230-252 (2024) - Vandana Y. Kakran, Jayesh M. Dhodiya:
A belief-degree-based two-stage multi-objective solid transportation problem in a green supply chain. Int. J. Math. Oper. Res. 28(1): 78-104 (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) - Hisham M. Khudhur, Hind H. Mohammed:
A new three-term conjugate gradient method for unconstrained optimisation and its applications in image restoration. Int. J. Math. Oper. Res. 28(2): 253-273 (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) - Dharma Lesmono, Taufik Limansyah, Ignatius A. Sandy:
A backorder inventory model considering price-sensitive and stock-dependent demand. Int. J. Math. Oper. Res. 27(3): 291-304 (2024) - Prokash Mondal, Pritha Das, Sudhansu Khanra:
An EOQ model for seasonal product with ramp-type time and stock dependent demand, shortage and partial backorder. Int. J. Math. Oper. Res. 27(3): 393-413 (2024) - Sukarna Dey Mondal, Dipendra Nath Ghosh, Pabitra Kumar Dey:
Statistical-based multi-criteria decision making approach for prediction of the grade of an institution in NAAC. Int. J. Math. Oper. Res. 27(3): 317-327 (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) - Broderick O. Oluyede, Neo Dingalo, Fastel Chipepa:
The Marshall-Olkin exponentiated half logistic-type II Topp-Leone-G family of distributions with applications. Int. J. Math. Oper. Res. 28(2): 163-194 (2024) - Gollapudi Prathyusha, K. N. Udaya Kumara, G. A. Vatsala:
Multi-goal multi-product fuzzy solid transportation problem via goal programming technique. Int. J. Math. Oper. Res. 27(3): 354-376 (2024) - Sivasamy Ramasamy, Keamogetse Setlhare, Olebogeng Mokgware:
Quasi-birth-and-death processes to determine economic order quantity of a queueing inventory system with impatient customers. Int. J. Math. Oper. Res. 27(4): 531-549 (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) - Satakshi, Vishal V. Henry:
A novel approach to find simple, pragmatic solutions to transportation problems. Int. J. Math. Oper. Res. 27(4): 496-508 (2024) - Manoj Kumar Sharma, Divya Mandal:
Preservation technology investment: a catalyst for sustainable two-warehouse inventory model and SDG achievement. Int. J. Math. Oper. Res. 28(1): 18-39 (2024) - Uttam Kumar Sharma, Varun Mohan, S. Sindhuja, Pervaiz Iqbal:
Economic order quantity model for Pareto distributed decaying products with quadratic demand, shortage and salvage value. Int. J. Math. Oper. Res. 27(4): 479-495 (2024) - K. Sikdar:
A single server finite buffer Geom/ G/1/ K queue with L limited service and multiple vacation policy. Int. J. Math. Oper. Res. 27(3): 328-353 (2024) - Mathew P. Sindu, Narayanan C. Viswanath:
Study of a birth-death process with population independent death rate. Int. J. Math. Oper. Res. 28(1): 60-77 (2024) - Mayank Singh, Madhu Jain, Arumugam Azhagappan:
Cost analysis of a transient Markovian queueing model with provision of options between regular and working vacation. Int. J. Math. Oper. Res. 28(2): 209-229 (2024)
skipping 750 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-10-01 06:30 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