Skip to main content
Skip to main navigation menu
Skip to site footer
Open Menu
Home
Volumes & Issues
Author Guidelines
Editorial Team
Editorial Board
Emeritus Editors
Journal Processes
More
Abstracting and Indexing
Forthcoming List
Journal History
Publication Ethics
Announcements
Privacy Statement
Statistics
Contact
Search
Register
Login
Home
/
Archives
/
Vol. 3 No. 1 (2013): IJOCTA
Vol. 3 No. 1 (2013): IJOCTA
Published:
2013-01-07
Mixed type second-order symmetric duality under F-convexity
Tilak Raj GULATI, Khushboo VERMA
1-5
PDF
Minimax fractional programming problem involving nonsmooth generalized ?-univex functions
Anurag JAYSWAL, Rajnish KUMAR, Dilip KUMAR
7-22
PDF
Application of a Mathematical Model to an Advertisement Reservation Problem
Ozlem COSGUN, Ilkay GULTAS, Mehmet N. SERARSLAN
23-33
PDF
Genetic algorithm for optimization in adaptive bus signal priority control
Tran Vu TU, Kazushi SANO
35-43
PDF
Generalized Transformation Techniques for Multi-Choice Linear Programming Problems
Srikumar ACHARYA, Mitali Madhumita ACHARYA
45-54
PDF
An Algorithm for Solution of an Interval Valued EOQ Model
Susovan CHAKRABORTTY, Madhumangal PAL, Prasun Kumar NAYAK
55-64
PDF
Equity in multiproduct supply chain network
Mina SAEE BOSTANABAD, Javad MEHRI-TEKMEH, Ali Moghanni DEHKHARGHANI
65-71
PDF
scopus
Impact Factor: 2.2
Quartile: Q1 - 46/331
(Applied Mathematics)
JCR™ 2023
3.3
2023
CiteScore
69th percentile
Powered by
Most Read This Year
List coloring based algorithm for the Futoshiki puzzle
461
Early prediction of fabric quality using machine learning to reduce rework in manufacturing processes
428
Examination and experimental comparison of dc/dc buck converter topologies used in wireless electric vehicle charging applications
405
Artificial bee colony algorithm for operating room scheduling problem with dedicated/flexible resources and cooperative operations
385
On analyzing two dimensional fractional order brain tumor model based on orthonormal Bernoulli polynomials and Newton's method
385
Keywords
Current Issue
Information
For Readers
For Authors
For Librarians