default search action
Katta G. Murty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j38]Katta G. Murty:
O(m) Bound on Number of Iterations in Sphere Methods for LP. Algorithmic Oper. Res. 7(1): 30-40 (2012) - [j37]Katta G. Murty:
Fast Descent Methods for LPs With No Matrix Inversions. Algorithmic Oper. Res. 7(2) (2012) - [j36]Bodhibrata Nag, Katta G. Murty:
Organizing National Elections in India to Elect the 543 Members of the Lok Sabha. Algorithmic Oper. Res. 7(2) (2012) - 2010
- [j35]Katta G. Murty, Mohammad R. Oskoorouchi:
Sphere Methods for LP. Algorithmic Oper. Res. 5(1): 21-33 (2010)
2000 – 2009
- 2009
- [j34]Matthew E. H. Petering, Katta G. Murty:
Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal. Comput. Oper. Res. 36(5): 1711-1725 (2009) - [j33]Vincent F. Yu, Katta G. Murty, Yat-wah Wan, Jerry Dann, Robin Lee:
Developing a DSS for Allocating Gates to Flights at an International Airport. Int. J. Decis. Support Syst. Technol. 1(1): 46-68 (2009) - [j32]Katta G. Murty, Mohammad R. Oskoorouchi:
Note on implementing the new sphere method for LP using matrix inversions sparingly. Optim. Lett. 3(1): 137-160 (2009) - [j31]Katta G. Murty:
A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes. Optim. Lett. 3(2): 211-237 (2009) - [r2]Katta G. Murty:
Complexity of Degeneracy. Encyclopedia of Optimization 2009: 419-425 - [r1]Katta G. Murty:
Second Order Optimality Conditions for Nonlinear Optimization. Encyclopedia of Optimization 2009: 3361-3365 - 2007
- [j30]Katta G. Murty:
Nonlinear Programming Theory and Algorithms. Technometrics 49(1): 105 (2007) - 2006
- [j29]Katta G. Murty:
A New Practically Efficient Interior Point Method for LP. Algorithmic Oper. Res. 1(1) (2006) - 2005
- [j28]Katta G. Murty, Jiyin Liu
, Yat-wah Wan, Richard Linn:
A decision support system for operations in a container terminal. Decis. Support Syst. 39(3): 309-332 (2005) - [j27]Katta G. Murty, Yat-wah Wan, Jiyin Liu
Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System. Interfaces 35(1): 61-75 (2005) - 2003
- [j26]Richard Linn, Jiyin Liu
Rubber tired gantry crane deployment for container yard operation. Comput. Ind. Eng. 45(3): 429-442 (2003) - 2002
- [j25]Tongnyoul Yi, Katta G. Murty, Cosimo Spera:
Matchings in colored bipartite networks. Discret. Appl. Math. 121(1-3): 261-277 (2002) - 2001
- [j24]Wieslawa T. Obuchowska, Katta G. Murty:
Cone of recession and unboundedness of convex functions. Eur. J. Oper. Res. 133(2): 409-415 (2001) - 2000
- [j23]Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty:
Facets of an Assignment Problem with 0-1 Side Constraint. J. Comb. Optim. 4(3): 365-388 (2000)
1990 – 1999
- 1999
- [j22]Katta G. Murty, Philipp A. Djang:
The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem. Oper. Res. 47(2): 175-182 (1999) - 1998
- [j21]Abdo Y. Alfakih, Katta G. Murty:
Adjacency on the Constrained Assignment Problem. Discret. Appl. Math. 87(1-3): 269-274 (1998) - 1995
- [j20]Katta G. Murty, Sung-Jin Chung:
Segments in enumerating faces. Math. Program. 70: 27-45 (1995) - 1993
- [j19]José C. Arantes, John R. Birge
Studies of lexicography in the generalized network simplex method. Ann. Oper. Res. 46-47(2): 235-248 (1993) - [j18]Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty:
Note on Combinatorial Optimization with Max-Linear Objective Functions. Discret. Appl. Math. 42(2): 139-145 (1993) - [j17]Katta G. Murty:
On the Complexity of a Special Basis Problem in LP. Discret. Appl. Math. 47(2): 181-185 (1993) - [j16]J. Ben Rosen, Katta G. Murty:
Book reviews. J. Glob. Optim. 3(4): 523-526 (1993) - 1992
- [j15]Khaled S. Al-Sultan, Katta G. Murty:
Exterior point algorithms for nearest points and convex quadratic programs. Math. Program. 57: 145-161 (1992) - 1990
- [j14]Leroy M. Kelly, Katta G. Murty, Layne T. Watson:
CP-Rays in Simplicial Cones. Math. Program. 48: 387-414 (1990)
1980 – 1989
- 1989
- [j13]Soo Y. Chang, Katta G. Murty:
The steepest descent gravitational method for linear programming. Discret. Appl. Math. 25(3): 211-239 (1989) - 1988
- [j12]Katta G. Murty:
A correction to a result in linear programming. Discret. Appl. Math. 20(2): 177-180 (1988) - 1987
- [j11]Katta G. Murty, Santosh N. Kabadi:
Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39(2): 117-129 (1987) - 1986
- [j10]Sung-Jin Chung, Katta G. Murty, Soo Y. Chang:
On KΔ. Discret. Appl. Math. 15(2-3): 199-211 (1986) - [j9]John T. Fredricksen, Layne T. Watson, Katta G. Murty:
A finite characterization ofK-matrices in dimensions less than four. Math. Program. 35(1): 17-31 (1986) - 1982
- [j8]Katta G. Murty, Yahya Fathi:
A critical index algorithm for nearest point problems on simplicial cones. Math. Program. 23(1): 206-215 (1982) - [j7]Katta G. Murty, Clovis Perin:
A 1-matching blossom-type algorithm for edge covering problems. Networks 12(4): 379-391 (1982) - [j6]R. Chandrasekaran, Santosh N. Kabadi, Katta G. Murty:
Some NP-complete problems in linear programming. Oper. Res. Lett. 1(3): 101-104 (1982) - 1980
- [j5]Katta G. Murty:
Computational complexity of parametric linear programming. Math. Program. 19(1): 213-219 (1980)
1970 – 1979
- 1973
- [j4]Katta G. Murty:
The graph of an abstract polytope. Math. Program. 4(1): 336-346 (1973) - 1972
- [j3]Katta G. Murty:
A fundamental problem in linear inequalities with applications to the travelling salesman problem. Math. Program. 2(1): 296-308 (1972)
1960 – 1969
- 1968
- [j2]Katta G. Murty:
Solving the Fixed Charge Problem by Ranking the Extreme Points. Oper. Res. 16(2): 268-279 (1968) - [j1]Katta G. Murty:
Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost. Oper. Res. 16(3): 682-687 (1968)
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-25 05:37 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: