M. R. Rao

According to our database, M. R. Rao authored at least 42 papers between 1968 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

A linear programming primer: from Fourier to Karmarkar.

Atlanta Chakraborty, Vijay Chandru, M. R. Rao

Ann. Oper. Res., 2020

2014

Combinatorial Optimization.

Vijay Chandru, M. R. Rao

Proceedings of the Computing Handbook, 2014

2004

Protein Folding on Lattices: An Integer Programming Approach.

Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan

Proceedings of the Sharpest Cut, 2004

2003

Easy and difficult objective functions for max cut.

S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi

Math. Program., 2003

1999

Decomposition of Balanced Matrices.

Michele Conforti, Gérard Cornuéjols, M. R. Rao

J. Comb. Theory, Ser. B, 1999

Linear Programming.

Vijay Chandru, M. R. Rao

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

Integer Programming.

Vijay Chandru, M. R. Rao

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Solution procedures for sizing of warehouses.

A. K. Rao, M. R. Rao

Eur. J. Oper. Res., 1998

1997

Combinatorial Optimization.

Vijay Chandru, M. R. Rao

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Combinatorial Optimization: An Integer Programming Perspective.

Vijay Chandru, M. R. Rao

ACM Comput. Surv., 1996

1995

Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.

Michele Conforti, Gérard Cornuéjols, M. R. Rao

Discret. Appl. Math., 1995

Facets of the K-partition Polytope.

Sunil Chopra, M. R. Rao

Discret. Appl. Math., 1995

1994

The Steiner tree problem II: Properties and classes of facets.

Sunil Chopra, M. R. Rao

Math. Program., 1994

The Steiner tree problem I: Formulations, compositions and extension of facets.

Sunil Chopra, M. R. Rao

Math. Program., 1994

1993

Testing balancedness and perfection of linear matrices.

Michele Conforti, M. R. Rao

Math. Program., 1993

The partition problem.

Sunil Chopra, M. R. Rao

Math. Program., 1993

1992

Structural properties and decomposition of linear balanced matrices.

Michele Conforti, M. R. Rao

Math. Program., 1992

Properties of balanced and perfect matrices.

Michele Conforti, M. R. Rao

Math. Program., 1992

Solving the Steiner Tree Problem on a Graph Using Branch and Cut.

Sunil Chopra, Edgar R. Gorres, M. R. Rao

INFORMS J. Comput., 1992

Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations.

Michele Conforti, M. R. Rao

Discret. Math., 1992

Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets.

Michele Conforti, M. R. Rao

Discret. Math., 1992

1991

On the multiway cut polyhedron.

Sunil Chopra, M. R. Rao

Networks, 1991

The equipartition polytope. II: Valid inequalities and facets.

Michele Conforti, M. R. Rao, Antonio Sassano

Math. Program., 1991

The equipartition polytope. I: Formulations, dimension and basic facets.

Michele Conforti, M. R. Rao, Antonio Sassano

Math. Program., 1991

1990

(1, k)-Configuration Facets for the Generalized Assignment Problem.

Elsie Sterbin Gottlieb, M. R. Rao

Math. Program., 1990

The Generalized Assignment Problem: Valid Inequalities and Facets.

Elsie Sterbin Gottlieb, M. R. Rao

Math. Program., 1990

Heuristic Methods for Selection and Ordering of Part-Orienting Devices.

Suresh P. Sethi, Chelliah Sriskandarajah, Giri Kumar Tayi, M. R. Rao

Oper. Res., 1990

1989

Odd cycles and matrices with integrality properties.

Michele Conforti, M. R. Rao

Math. Program., 1989

1987

Structural properties and recognition of restricted and strongly unimodular matrices.

Michele Conforti, M. R. Rao

Math. Program., 1987

Some New Matroids on Graphs: Cut Sets and the Max Cut Problem.

Michele Conforti, M. R. Rao

Math. Oper. Res., 1987

1983

On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems.

D. Chinhyung Cho, Manfred W. Padberg, M. R. Rao

Math. Oper. Res., 1983

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets.

D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao

Math. Oper. Res., 1983

The Discrete-Time Sequencing Expansion Problem.

Alan W. Neebe, M. R. Rao

Oper. Res., 1983

1982

Odd Minimum Cut-Sets and <i>b</i>-Matchings.

Manfred W. Padberg, M. R. Rao

Math. Oper. Res., 1982

1980

Technical Note - A Note on the Multiple Traveling Salesmen Problem.

M. R. Rao

Oper. Res., 1980

1976

Optimal Capacity Expansion with Inventory.

M. R. Rao

Oper. Res., 1976

1975

Optimal Network Capacity Planning: A Shortest-Path Scheme.

P. J. Doulliez, M. R. Rao

Oper. Res., 1975

1974

The travelling salesman problem and a class of polyhedra of diameter two.

Manfred W. Padberg, M. R. Rao

Math. Program., 1974

1973

Technical Note - Some Comments on "Linear" Programming with Absolute-Value Functionals.

M. R. Rao

Oper. Res., 1973

Technical Note - A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints.

R. Jagannathan, M. R. Rao

Oper. Res., 1973

1971

Capacity of a Network with Increasing Demands and Arcs Subject to Failure.

P. J. Doulliez, M. R. Rao

Oper. Res., 1971

1968

Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems.

M. R. Rao, Stanley Zionts

Oper. Res., 1968