default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. K. Neogy
Person information
- affiliation: Indian Statistical Institute, New Delhi, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Dipti Dubey, S. K. Neogy, T. E. S. Raghavan:
A Note on Linear Complementarity via Two-Person Zero-Sum Games. IGTR 25(1): 2250019:1-2250019:8 (2023)- [j26]S. K. Neogy, R. B. Bapat, T. Parthasarathy:
Preface - Special Issue on Computational Operations Research and Algorithmic Game Theory. IGTR 25(3): 2302001:1-2302001:3 (2023) - [j25]Gambheer Singh
, Vatsalkumar N. Mer, Promila Kumar, S. K. Neogy:
Some more subclasses of Q-matrix. Oper. Res. Lett. 51(1): 111-115 (2023) - 2022
- [j24]S. K. Neogy, R. B. Bapat, K. Manjunatha Prasad, Asha Kamath:
Preface: Business analytics and operations research. Ann. Oper. Res. 315(2): 623-628 (2022) - [j23]Dipti Dubey, S. K. Neogy:
On testing nonnegativity of principal minors of ${\mathbf {Z}}$-matrices using simplex method. Ann. Oper. Res. 315(2): 985-992 (2022) - 2020
- [j22]Dipti Dubey, S. K. Neogy:
On solving a non-convex quadratic programming problem involving resistance distances in graphs. Ann. Oper. Res. 287(2): 643-651 (2020) - [j21]Nagarajan Krishnamurthy, S. K. Neogy:
On Lemke processibility of LCP formulations for solving discounted switching control stochastic games. Ann. Oper. Res. 295(2): 633-644 (2020) - [j20]S. K. Neogy, R. B. Bapat, Dipti Dubey, T. Parthasarathy:
Preface to The Special Issue on - Operations Research and Game Theory: Modeling and Computation. IGTR 22(2): 2002001:1-2002001:3 (2020) - [j19]Prasenjit Mondal, S. K. Neogy, Abhijit Gupta, Debasish Ghorui:
A Policy Improvement Algorithm for Solving a Mixture Class of Perfect Information and AR-AT Semi-Markov Games. IGTR 22(2): 2040008:1-2040008:19 (2020)
2010 – 2019
- 2018
- [j18]S. K. Neogy, Prasenjit Mondal, Abhijit Gupta, Debasish Ghorui:
On Solving Mean Payoff Games Using Pivoting Algorithms. Asia Pac. J. Oper. Res. 35(5): 1850035:1-1850035:26 (2018) - 2017
- [j17]Dipti Dubey, S. K. Neogy, Debasish Ghorui:
Completely Mixed Strategies for Generalized Bimatrix and Switching Controller Stochastic Game. Dyn. Games Appl. 7(4): 535-554 (2017) - 2016
- [j16]S. K. Neogy, R. B. Bapat, A. K. Das, Biswabrata Pradhan:
Optimization models with economic and game theoretic applications. Ann. Oper. Res. 243(1-2): 1-3 (2016) - [j15]R. B. Bapat, S. K. Neogy:
On a quadratic programming problem involving distances in trees. Ann. Oper. Res. 243(1-2): 365-373 (2016) - [j14]Prasenjit Mondal, S. Sinha, S. K. Neogy, A. K. Das:
On discounted AR-AT semi-Markov games and its complementarity formulations. Int. J. Game Theory 45(3): 567-583 (2016) - 2015
- [j13]S. K. Neogy, T. Parthasarathy, A. K. Das:
Preface. IGTR 17(1): 1502001:1-1502001:4 (2015) - [j12]S. K. Neogy, T. Parthasarathy, A. K. Das:
Preface. IGTR 17(2): 1502002:1-1502002:3 (2015) - 2012
- [j11]S. K. Neogy, A. K. Das, Abhijit Gupta:
Generalized principal pivot transforms, complementarity theory and their applications in stochastic games. Optim. Lett. 6(2): 339-356 (2012)
2000 – 2009
- 2007
- [j10]S. R. Mohan, S. K. Neogy, A. Seth, N. K. Garg, S. Mittal:
An Optimization Model to Determine Master Designs and Runs for Advertisement Printing. J. Math. Model. Algorithms 6(2): 259-271 (2007) - [j9]S. K. Neogy, A. K. Das, P. Das:
On Linear Fractional Programming Problem and its Computation Using a Neural Network Model. J. Math. Model. Algorithms 6(4): 577-590 (2007) - 2006
- [j8]S. K. Neogy, A. K. Das:
Some Properties of Generalized Positive Subdefinite Matrices. SIAM J. Matrix Anal. Appl. 27(4): 988-995 (2006) - 2004
- [j7]S. R. Mohan, S. K. Neogy, A. K. Das:
A note on linear complementarity problems and multiple objective programming. Math. Program. 100(2): 339-344 (2004) - 2001
- [j6]S. R. Mohan, S. K. Neogy, T. Parthasarathy:
Pivoting Algorithms for Some Classes of Stochastic Games: a Survey. IGTR 3(2-3): 253-281 (2001) - 2000
- [j5]G. S. R. Murthy, S. K. Neogy, Frank Thuijsman:
A Note on P1 - and Lipschitzian Matrices. SIAM J. Matrix Anal. Appl. 21(2): 636-641 (2000)
1990 – 1999
- 1999
- [j4]S. R. Mohan, S. K. Neogy, T. Parthasarathy, S. Sinha:
Vertical linear complementarity and discounted zero-sum stochastic games with ARAT structure. Math. Program. 86(3): 637-648 (1999) - 1997
- [j3]S. R. Mohan, S. K. Neogy:
Vertical Block Hidden Z-Matrices And The Generalized Linear Complementarity Problem. SIAM J. Matrix Anal. Appl. 18(1): 181-190 (1997) - 1996
- [j2]S. R. Mohan, S. K. Neogy, R. Sridhar:
The generalized linear complementarity problem revisited. Math. Program. 74: 197-218 (1996) - [j1]S. R. Mohan, S. K. Neogy:
Algorithms for the Generalized Linear Complementarity Problem with a Vertical Block Z-Matrix. SIAM J. Optim. 6(4): 994-1006 (1996)
Coauthor Index
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.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
