R. Chandrasekaran

From MaRDI portal
(Redirected from Person:584055)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Robust discrete spanning tree problem: local search algorithms
Opsearch
2022-10-18Paper
Analyzing read-once cutting plane proofs in Horn systems
Journal of Automated Reasoning
2022-06-09Paper
Analyzing fractional Horn constraint systems
Theoretical Computer Science
2020-10-21Paper
Classification of textile fabrics using statistical multivariate techniques
Journal of Applied Statistics
2020-10-21Paper
Restricted cutting plane proofs in Horn constraint systems2020-05-13Paper
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
Theoretical Computer Science
2020-01-29Paper
Lexico-minimum replica placement in multitrees
(available as arXiv preprint)
2018-03-26Paper
On a generalization of Horn constraint systems2017-08-22Paper
On replica placement in high-availability storage under correlated failure
Combinatorial Optimization and Applications
2016-02-05Paper
Integer Farkas lemma
International Game Theory Review
2015-04-01Paper
A combinatorial algorithm for Horn programs
Discrete Optimization
2014-04-15Paper
Obituary: Santosh Narayan Kabadi (1956--2010)
Algorithmic Operations Research
2013-12-11Paper
2-commodity integer network synthesis problem
Algorithmic Operations Research
2013-12-11Paper
Infeasibility analysis for linear systems, a survey
The Arabian Journal for Science and Engineering. Section C: Theme Issues
2013-09-11Paper
Isotonic separation
INFORMS Journal on Computing
2012-06-18Paper
A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks
European Journal of Operational Research
2010-03-01Paper
A combinatorial algorithm for Horn programs
Algorithms and Computation
2009-12-17Paper
Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot
Operations Research
2009-07-10Paper
Integer version of the multipath flow network synthesis problem
Discrete Applied Mathematics
2009-03-04Paper
Time-efficient distributed layer-2 auto-configuration for cognitive radio networks
Computer Networks
2008-03-11Paper
Geometric problems in automated manufacturing.
Opsearch
2008-01-25Paper
The maximum residual flow problem: NP‐hardness with two‐arc destruction
Networks
2008-01-07Paper
Flows over edge-disjoint mixed multipaths and applications
Discrete Applied Mathematics
2007-09-19Paper
Breast cancer prediction using the isotonic separation technique
European Journal of Operational Research
2007-04-19Paper
The multiroute maximum flow problem revisited
Networks
2006-05-16Paper
Multiroute flows: cut-trees and realizability
Discrete Optimization
2006-01-09Paper
Multi-terminal multipath flows: synthesis
Discrete Applied Mathematics
2004-11-23Paper
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
2003-06-19Paper
Parametric min-cuts analysis in a network.
Discrete Applied Mathematics
2003-06-10Paper
Parametric analysis of overall min-cuts and applications in undirected networks.
Information Processing Letters
2003-01-21Paper
Maximizing residual flow under an arc destruction
Networks
2002-07-01Paper
Integer solution for linear complementarity problem
Mathematics of Operations Research
2001-11-26Paper
A constrained least-squares algorithm with data-adaptive beamforming and equalization for cochannel TDMA signals.
Signal Processing
2000-10-26Paper
A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling"
SIAM Journal on Computing
1997-05-26Paper
Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\)
Linear Algebra and its Applications
1997-02-27Paper
An extension of a theorem of Fulkerson and Gross
Linear Algebra and its Applications
1996-12-01Paper
A rounding algorithm for integer programs
Discrete Applied Mathematics
1995-05-01Paper
scientific article; zbMATH DE number 16721 (Why is no real title available?)1992-06-26Paper
A problem in vision that is polynomially solvable
Opsearch
1991-01-01Paper
Algebraic optimization: The Fermat-Weber location problem
Mathematical Programming. Series A. Series B
1990-01-01Paper
On totally dual integral systems
Discrete Applied Mathematics
1990-01-01Paper
On the \(\epsilon\)-perturbation method for avoiding degeneracy
Operations Research Letters
1989-01-01Paper
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
Mathematical Programming. Series A. Series B
1989-01-01Paper
Pseudomatroids
Discrete Mathematics
1988-01-01Paper
A note on the m-center problem with rectilinear distances
European Journal of Operational Research
1988-01-01Paper
scientific article; zbMATH DE number 4041025 (Why is no real title available?)1988-01-01Paper
Strongly polynomial algorithm for a class of combinatorial LCPs
Operations Research Letters
1987-01-01Paper
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
Operations Research
1987-01-01Paper
Two counterexamples on the polynomial solvability of the linear complementarity problem
Mathematical Programming
1987-01-01Paper
Recognition of Gilmore-Gomory traveling salesman problem
Discrete Applied Mathematics
1986-01-01Paper
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
Mathematical Programming Essays in Honor of George B. Dantzig Part II
1985-01-01Paper
Optimal improvements in bottleneck systems
Opsearch
1985-01-01Paper
Classes of linear programs with integral optimal solutions
Mathematical Programming Essays in Honor of George B. Dantzig Part I
1985-01-01Paper
Polynomial testing of the query Is \(a^ b\geq c^ d?\) with application to finding a minimal cost reliability ratio spanning tree
Discrete Applied Mathematics
1984-01-01Paper
Production Planning in Assembly Line Systems
Management Science
1984-01-01Paper
Total weak unimodularity: Testing and applications
Discrete Mathematics
1984-01-01Paper
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
Mathematical Programming
1984-01-01Paper
On the integrality of an extreme solution to pluperfect graph and balanced systems
Operations Research Letters
1984-01-01Paper
scientific article; zbMATH DE number 3880440 (Why is no real title available?)1984-01-01Paper
Technical Note—Monotone Optimal Issuing Policies in a Deterministic Inventory Model
Operations Research
1983-01-01Paper
The weighted Euclidean 1-center problem
Operations Research Letters
1982-01-01Paper
Polynomially bounded algorithms for locatingp-centers on a tree
Mathematical Programming
1982-01-01Paper
Some NP-complete problems in linear programming
Operations Research Letters
1982-01-01Paper
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
SIAM Journal on Computing
1981-01-01Paper
Location on Tree Networks: P-Centre and n-Dispersion Problems
Mathematics of Operations Research
1981-01-01Paper
Polynomial Algorithms for Totally Dual Integral Systems and Extensions
North-Holland Mathematics Studies
1981-01-01Paper
Minimal Cost-Reliability Ratio Spanning Tree
North-Holland Mathematics Studies
1981-01-01Paper
Weighted min-max location problems: Polynomially bounded algorithms
Opsearch
1980-01-01Paper
An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
SIAM Journal on Algebraic Discrete Methods
1980-01-01Paper
Local unimodularity of matrix-vector pairs
Linear Algebra and its Applications
1978-01-01Paper
Computer recognition of printed Tamil characters
Pattern Recognition
1978-01-01Paper
Minimal ratio spanning trees
Networks
1977-01-01Paper
Technical Note—A Special Case of the Transportation Problem
Operations Research
1977-01-01Paper
A Class of Sequential Games
Operations Research
1971-01-01Paper
Total Unimodularity of Matrices
SIAM Journal on Applied Mathematics
1969-01-01Paper


Research outcomes over time


This page was built for person: R. Chandrasekaran