M. R. Rao - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2020

A linear programming primer: from Fourier to KarmarkarAtlanta Chakraborty, Vijay Chandru, M. R. Rao. anor, 287(2):593-616, 2020. [doi]

2014

Combinatorial OptimizationVijay Chandru, M. R. Rao. In Teofilo F. Gonzalez, Jorge Diaz-Herrera, Allen Tucker, editors, Computing Handbook, Third Edition: Computer Science and Software Engineering. CRC Press, 2014.

2003

Easy and difficult objective functions for max cutS. Thomas McCormick, M. R. Rao, Giovanni Rinaldi. mp, 94(2-3):459-466, 2003. [doi]

1999

Linear ProgrammingVijay Chandru, M. R. Rao. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

Integer ProgrammingVijay Chandru, M. R. Rao. In Mikhail J. Atallah, editor, Algorithms and Theory of Computation Handbook. Chapman & Hall/CRC Applied Algorithms and Data Structures series, CRC Press, 1999. [doi]

Decomposition of Balanced MatricesMichele Conforti, Gérard Cornuéjols, M. R. Rao. JCT, 77(2):292-406, 1999. [doi]

1998

Solution procedures for sizing of warehousesA. K. Rao, M. R. Rao. eor, 108(1):16-25, 1998. [doi]

1997

Combinatorial OptimizationVijay Chandru, M. R. Rao. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 316-354, CRC Press, 1997.

1996

Combinatorial Optimization: An Integer Programming PerspectiveVijay Chandru, M. R. Rao. ACM Comput. Surv., 28(1):55-58, 1996.

1995

Facets of the K-partition PolytopeSunil Chopra, M. R. Rao. DAM, 61(1):27-48, 1995. [doi]

Decomposition of Wheel-and-parachute-free Balanced Bipartite GraphsMichele Conforti, Gérard Cornuéjols, M. R. Rao. DAM, 62(1-3):103-117, 1995. [doi]

1994

The Steiner tree problem I: Formulations, compositions and extension of facetsSunil Chopra, M. R. Rao. mp, 64:209-229, 1994.

The Steiner tree problem II: Properties and classes of facetsSunil Chopra, M. R. Rao. mp, 64:231-246, 1994.

1993

The partition problemSunil Chopra, M. R. Rao. mp, 59:87-115, 1993.

Testing balancedness and perfection of linear matricesMichele Conforti, M. R. Rao. mp, 61:1-18, 1993.

1992

Solving the Steiner Tree Problem on a Graph Using Branch and CutSunil Chopra, Edgar R. Gorres, M. R. Rao. informs, 4(3):320-335, 1992. [doi]

Articulation sets in linear perfect matrices II: the wheel theorem and clique articulationsMichele Conforti, M. R. Rao. DM, 110(1-3):81-118, 1992. [doi]

Structural properties and decomposition of linear balanced matricesMichele Conforti, M. R. Rao. mp, 55:129-168, 1992.

Articulation sets in linear perfect matrices I: forbidden configurations and star cutsetsMichele Conforti, M. R. Rao. DM, 104(1):23-47, 1992. [doi]

Properties of balanced and perfect matricesMichele Conforti, M. R. Rao. mp, 55:35-47, 1992.

1991

On the multiway cut polyhedronSunil Chopra, M. R. Rao. networks, 21(1):51-89, 1991. [doi]

The equipartition polytope. I: Formulations, dimension and basic facetsMichele Conforti, M. R. Rao, Antonio Sassano. mp, 49:49-70, 1991.

The equipartition polytope. II: Valid inequalities and facetsMichele Conforti, M. R. Rao, Antonio Sassano. mp, 49:71-90, 1991.

1990

(1, k)-Configuration Facets for the Generalized Assignment ProblemElsie Sterbin Gottlieb, M. R. Rao. mp, 46:53-60, 1990.

The Generalized Assignment Problem: Valid Inequalities and FacetsElsie Sterbin Gottlieb, M. R. Rao. mp, 46:31-52, 1990.

Heuristic Methods for Selection and Ordering of Part-Orienting DevicesSuresh P. Sethi, Chelliah Sriskandarajah, Giri Kumar Tayi, M. R. Rao. ior, 38(1):84-98, 1990. [doi]

1989

Odd cycles and matrices with integrality propertiesMichele Conforti, M. R. Rao. mp, 45(1-3):279-294, 1989. [doi]

1987

Structural properties and recognition of restricted and strongly unimodular matricesMichele Conforti, M. R. Rao. mp, 38(1):17-27, 1987. [doi]

Some New Matroids on Graphs: Cut Sets and the Max Cut ProblemMichele Conforti, M. R. Rao. mor, 12(2):193-204, 1987. [doi]

1983

On the Uncapacitated Plant Location Problem. II: Facets and Lifting TheoremsD. Chinhyung Cho, Manfred W. Padberg, M. R. Rao. mor, 8(4):590-612, 1983. [doi]

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and FacetsD. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao. mor, 8(4):579-589, 1983. [doi]

The Discrete-Time Sequencing Expansion ProblemAlan W. Neebe, M. R. Rao. ior, 31(3):546-558, 1983. [doi]

1982

b-MatchingsManfred W. Padberg, M. R. Rao. mor, 7(1):67-80, 1982. [doi]

1980

Technical Note - A Note on the Multiple Traveling Salesmen ProblemM. R. Rao. ior, 28(3-Part-I):628-632, 1980. [doi]

1976

Optimal Capacity Expansion with InventoryM. R. Rao. ior, 24(2):291-300, 1976. [doi]

1975

Optimal Network Capacity Planning: A Shortest-Path SchemeP. J. Doulliez, M. R. Rao. ior, 23(4):810-818, 1975. [doi]

1974

The travelling salesman problem and a class of polyhedra of diameter twoManfred W. Padberg, M. R. Rao. mp, 7(1):32-45, 1974. [doi]

1973

Technical Note - A Class of Nonlinear Chance-Constrained Programming Models with Joint ConstraintsR. Jagannathan, M. R. Rao. ior, 21(1):360-364, 1973. [doi]

Technical Note - Some Comments on "Linear" Programming with Absolute-Value FunctionalsM. R. Rao. ior, 21(1):373-374, 1973. [doi]

1971

Capacity of a Network with Increasing Demands and Arcs Subject to FailureP. J. Doulliez, M. R. Rao. ior, 19(4):905-915, 1971. [doi]

1968

Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter SubproblemsM. R. Rao, Stanley Zionts. ior, 16(1):52-63, 1968. [doi]

Sign in or sign up to see more results.

runs on WebDSL