The following pages link to Ramesh Krishnamurti (Q203718):
Displaying 36 items.
- Erratum to: The capacitated max \(k\)-cut problem (Q623467) (← links)
- The cyclical scheduling problem (Q744050) (← links)
- On the minimum satisfiability problem (Q779212) (← links)
- The capacitated max \(k\)-cut problem (Q930343) (← links)
- Self-duality of bounded monotone Boolean functions and related problems (Q944707) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578) (← links)
- Optimal product design using conjoint analysis: Computational complexity and algorithms (Q1115344) (← links)
- A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)
- Joint performance of greedy heuristics for the integer knapsack problem (Q1343153) (← links)
- On polynomial-time approximation algorithms for the variable length scheduling problem. (Q1401344) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- An efficient heuristic scheme for dynamic remapping of parallel computations (Q1802665) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Mulling over shapes, rules and numbers (Q2361313) (← links)
- Subset-conjunctive rules for breast cancer diagnosis (Q2489654) (← links)
- Berge's theorem for the maximum charge problem (Q2506824) (← links)
- The multiple TSP with time windows: vehicle bounds based on precedence graphs (Q2583718) (← links)
- Consistent subset problem with two labels (Q2636557) (← links)
- (Q2753937) (← links)
- PTAS for Ordered Instances of Resource Allocation Problems (Q2963935) (← links)
- Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System (Q2971639) (← links)
- Conflict Resolution in the Scheduling of Television Commercials (Q3100410) (← links)
- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem (Q3150279) (← links)
- An approximation algorithm for max<i>k</i>-uncut with capacity constraints (Q3225074) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- (Q4287435) (← links)
- The Minimum Satisfiability Problem (Q4296521) (← links)
- (Q4473243) (← links)
- (Q4511216) (← links)
- Average Performance of Heuristics for Satisfiability (Q4729354) (← links)
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems (Q4863982) (← links)
- (Q4893400) (← links)
- The Cyclical Scheduling Problem (Q4914450) (← links)
- Advances in Artificial Intelligence (Q5901319) (← links)
- Simple approximation algorithms for MAXNAESP and hypergraph 2-colorability (Q5943819) (← links)
