The following pages link to R. Chandrasekaran (Q584055):
Displaying 50 items.
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- Total weak unimodularity: Testing and applications (Q798401) (← links)
- On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) (← links)
- Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
- A problem in vision that is polynomially solvable (Q806846) (← links)
- Breast cancer prediction using the isotonic separation technique (Q877069) (← links)
- A note on the m-center problem with rectilinear distances (Q913636) (← links)
- Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
- Optimal improvements in bottleneck systems (Q1058455) (← links)
- Recognition of Gilmore-Gomory traveling salesman problem (Q1080781) (← links)
- Strongly polynomial algorithm for a class of combinatorial LCPs (Q1088911) (← links)
- Pseudomatroids (Q1109779) (← links)
- Weighted min-max location problems: Polynomially bounded algorithms (Q1149372) (← links)
- The weighted Euclidean 1-center problem (Q1165764) (← links)
- Computer recognition of printed Tamil characters (Q1249443) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- A rounding algorithm for integer programs (Q1327212) (← links)
- A constrained least-squares algorithm with data-adaptive beamforming and equalization for cochannel TDMA signals. (Q1583106) (← links)
- Lexico-minimum replica placement in multitrees (Q1708602) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- An extension of a theorem of Fulkerson and Gross (Q1816927) (← links)
- On the \(\epsilon\)-perturbation method for avoiding degeneracy (Q1824546) (← links)
- On totally dual integral systems (Q1824553) (← links)
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem (Q1825115) (← links)
- Some NP-complete problems in linear programming (Q1837108) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- Multi-terminal multipath flows: synthesis (Q1887053) (← links)
- Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\) (Q1923196) (← links)
- Robust discrete spanning tree problem: local search algorithms (Q2085475) (← links)
- Restricted cutting plane proofs in Horn constraint systems (Q2180223) (← links)
- Analyzing fractional Horn constraint systems (Q2205946) (← links)
- A branch-and-cut algorithm for the strong minimum energy topology in wireless sensor networks (Q2267666) (← links)
- Algorithms for optimal replica placement under correlated failure in hierarchical failure domains (Q2290650) (← links)
- Flows over edge-disjoint mixed multipaths and applications (Q2381819) (← links)
- On a generalization of Horn constraint systems (Q2399383) (← links)
- A combinatorial algorithm for Horn programs (Q2445839) (← links)
- Geometric problems in automated manufacturing. (Q2468599) (← links)
- Time-efficient distributed layer-2 auto-configuration for cognitive radio networks (Q2475949) (← links)
- Multiroute flows: cut-trees and realizability (Q2581318) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- (Q2847609) (← links)
- (Q2865854) (← links)
- (Q2867369) (← links)
- Isotonic Separation (Q2892263) (← links)
- Technical Note—Monotone Optimal Issuing Policies in a Deterministic Inventory Model (Q3325416) (← links)
- (Q3346090) (← links)
- On Replica Placement in High-Availability Storage Under Correlated Failure (Q3467856) (← links)
- Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot (Q3637411) (← links)
- A Combinatorial Algorithm for Horn Programs (Q3652297) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
