Katta G. Murty

According to our database1, Katta G. Murty authored at least 40 papers between 1968 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Organizing National Elections in India to Elect the 543 Members of the Lok Sabha.
Algorithmic Oper. Res., 2012

Fast Descent Methods for LPs With No Matrix Inversions.
Algorithmic Oper. Res., 2012

<i>O</i>(<i>m</i>) Bound on Number of Iterations in Sphere Methods for LP.
Algorithmic Oper. Res., 2012

2010
Sphere Methods for LP.
Algorithmic Oper. Res., 2010

2009
Second Order Optimality Conditions for Nonlinear Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Complexity of Degeneracy.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Note on implementing the new sphere method for LP using matrix inversions sparingly.
Optim. Lett., 2009

A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes.
Optim. Lett., 2009

Developing a DSS for Allocating Gates to Flights at an International Airport.
Int. J. Decis. Support Syst. Technol., 2009

Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal.
Comput. Oper. Res., 2009

2007
Nonlinear Programming Theory and Algorithms.
Technometrics, 2007

2006
A New Practically Efficient Interior Point Method for LP.
Algorithmic Oper. Res., 2006

2005
Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System.
Interfaces, 2005

A decision support system for operations in a container terminal.
Decis. Support Syst., 2005

2003
Rubber tired gantry crane deployment for container yard operation.
Comput. Ind. Eng., 2003

2002
Matchings in colored bipartite networks.
Discret. Appl. Math., 2002

2001
Cone of recession and unboundedness of convex functions.
Eur. J. Oper. Res., 2001

2000
Facets of an Assignment Problem with 0-1 Side Constraint.
J. Comb. Optim., 2000

1999
The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem.
Oper. Res., 1999

1998
Adjacency on the Constrained Assignment Problem.
Discret. Appl. Math., 1998

1995
Segments in enumerating faces.
Math. Program., 1995

1993
Book reviews.
J. Glob. Optim., 1993

On the Complexity of a Special Basis Problem in LP.
Discret. Appl. Math., 1993

Note on Combinatorial Optimization with Max-Linear Objective Functions.
Discret. Appl. Math., 1993

Studies of lexicography in the generalized network simplex method.
Ann. Oper. Res., 1993

1992
Exterior point algorithms for nearest points and convex quadratic programs.
Math. Program., 1992

1990
CP-Rays in Simplicial Cones.
Math. Program., 1990

1989
The steepest descent gravitational method for linear programming.
Discret. Appl. Math., 1989

1988
A correction to a result in linear programming.
Discret. Appl. Math., 1988

1987
Some NP-complete problems in quadratic and nonlinear programming.
Math. Program., 1987

1986
A finite characterization of<i>K</i>-matrices in dimensions less than four.
Math. Program., 1986

On K<sup>Δ</sup>.
Discret. Appl. Math., 1986

1982
Some NP-complete problems in linear programming.
Oper. Res. Lett., 1982

A 1-matching blossom-type algorithm for edge covering problems.
Networks, 1982

A critical index algorithm for nearest point problems on simplicial cones.
Math. Program., 1982

1980
Computational complexity of parametric linear programming.
Math. Program., 1980

1973
The graph of an abstract polytope.
Math. Program., 1973

1972
A fundamental problem in linear inequalities with applications to the travelling salesman problem.
Math. Program., 1972

1968
Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost.
Oper. Res., 1968

Solving the Fixed Charge Problem by Ranking the Extreme Points.
Oper. Res., 1968


  Loading...