R. Chandrasekaran

Information about the author R. Chandrasekaran will soon be added to the site.

Found 17 papers in total

Prognosis using an isotonic prediction technique

2004

Outcome prediction based on historical data has been of practical and theoretical...

Isotonic separation

2005

Data classification and prediction problems are prevalent in many domains. The need to...

The multiroute maximum flow problem revisited

2006

We are given a directed network G = (V,A,u) with vertex set V , arc set A , a source...

Integer solution for linear complementarity problem

1998

We consider the problem of finding an integer solution to a linear complementarity...

Maximizing residual flow under an arc destruction

2001

In this paper, we consider two problems related to single-commodity flows on a...

Identifying alternate optimal solutions to the design approximation problem in stock cutting

1999

The design approximation problem is a well known problem in stock cutting, where, in...

Geometric problems in automated manufacturing

1999

In this paper, the following two classes of problems in automated inspection are...

Art gallery problems for convex nested polygons

1997

In this article, we study a class of Art Gallery problems that are defined on a pair...

Stock cutting to minimize cutting length

1996

In this paper we investigate the following problem: Given two convex shapes P in and P...

Art Gallery problems for convex nested polygons

1997

In this article, the authors study a class of Art Gallery problems that are defined on...

Stock cutting of complicated designs by computing minimal nested polygons

1995

This paper studies the following problem in stock cutting: when it is required to cut...

Competitive location and entry deterrence in Hotelling’s duopoly model

1994

This paper analyzes the problem of two firms competing in a common linear market with...

Integer solution to synthesis of communication networks

1992

This paper describes a polynomial-time algorithm for the following problem: Let be the...

A problem in vision that is polynomially solvable

1991

In this paper, the authors consider the problem of fitting the best circle to a given...

Algebraic optimization: The Fermat-Weber location problem

1990

The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...

Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem

1989

The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...

On the ℝà-perturbation method for avoiding degeneracy

1989

Although it is NP-complete to decide whether a linear programming problem is...

Papers per page: