M. R. Rao

发表

Odd cycles and matrices with integrality properties

Michele Conforti, M. R. Rao, M. Rao, 1989, Math. Program..

Combinatorial optimization: an integer programming perspective

M. R. Rao, Vijay Chandru, 1996, CSUR.

North-Holland 23 Articulation sets in linear matrices I : forbidden perfect configurations and star cutsets *

Michele Conforti, M. R. Rao, M. Rao, 2001 .

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

Michele Conforti, M. R. Rao, M. Rao, 1987, Math. Oper. Res..

Easy and difficult objective functions for max cut

Giovanni Rinaldi, S. Thomas McCormick, M. R. Rao, 2003, Math. Program..

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

Antonio Sassano, Michele Conforti, M. R. Rao, 1990, Math. Program..

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

M. R. Rao, R. Jagannathan, M. Rao, 1973, Oper. Res..

Odd Minimum Cut-Sets and b-Matchings

M. R. Rao, Manfred W. Padberg, M. Padberg, 1982, Math. Oper. Res..

The generalized assignment problem: Valid inequalities and facets

M. R. Rao, Elsie Sterbin Gottlieb, M. Rao, 1990, Math. Program..

Properties of balanced and perfect matrices

Michele Conforti, M. R. Rao, 1992, Math. Program..

The equipartition polytope. II: Valid inequalities and facets

Antonio Sassano, Michele Conforti, M. R. Rao, 1990, Math. Program..

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

Gérard Cornuéjols, Michele Conforti, M. R. Rao, 1995, Discret. Appl. Math..

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

M. R. Rao, Sunil Chopra, M. Rao, 1994, Math. Program..

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

M. R. Rao, Manfred W. Padberg, M. Padberg, 1974, Math. Program..

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

M. R. Rao, Stanley Zionts, M. Rao, 1968, Oper. Res..

Structural properties and decomposition of linear balanced matrices

Michele Conforti, M. R. Rao, M. Rao, 1992, Math. Program..

Heuristic Methods for Selection and Ordering of Part-Orienting Devices

Chelliah Sriskandarajah, Suresh P. Sethi, M. R. Rao, 1990, Oper. Res..

New approaches to reduce the cost of hybrid cotton seed production : crossing and boll load management

M. R. Rao, N. L. Bhale, R. K. Deshmukh, 1989 .

The Discrete-Time Sequencing Expansion Problem

M. R. Rao, Alan W. Neebe, M. Rao, 1983, Oper. Res..

Structural properties and recognition of restricted and strongly unimodular matrices

Michele Conforti, M. R. Rao, M. Rao, 1987, Math. Program..

The Steiner tree problem II: Properties and classes of facets

M. R. Rao, Sunil Chopra, 1994, Math. Program..

Non-planar network with edges subject to failure and enumeration of proper cuts

M. R. Rao, P. J. Doulliez, 1973 .

Technical Note - A Note on the Multiple Traveling Salesmen Problem

M. R. Rao, M. Rao, 1980, Oper. Res..

Solution procedures for sizing of warehouses

M. R. Rao, A. K. Rao, A. Rao, 1998, Eur. J. Oper. Res..

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

M. R. Rao, M. Rao, 1973, Oper. Res..

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

Michele Conforti, M. R. Rao, 1992, Discret. Math..

Optimal Network Capacity Planning: A Shortest-Path Scheme

M. R. Rao, P. J. Doulliez, M. Rao, 1975, Oper. Res..

Optimal Capacity Expansion with Inventory

M. R. Rao, M. Rao, 1976, Oper. Res..

The partition problem

M. R. Rao, Sunil Chopra, M. Rao, 1993, Math. Program..

Combinatorial Optimization

M. R. Rao, Vijay Chandru, M. Rao, 1992, NATO ASI Series.

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

M. R. Rao, Sunil Chopra, Edgar R. Gorres, 1992, INFORMS J. Comput..

On the multiway cut polyhedron

M. R. Rao, Sunil Chopra, M. Rao, 1991, Networks.

Testing balancedness and perfection of linear matrices

Michele Conforti, M. R. Rao, M. Rao, 1993, Math. Program..

Decomposition of Balanced Matrices

Gérard Cornuéjols, Michele Conforti, M. R. Rao, 1999, J. Comb. Theory, Ser. B.

Facets of the K-partition Polytope

M. R. Rao, Sunil Chopra, M. Rao, 1995, Discret. Appl. Math..

(1,k)-configuration facets for the generalized assignment problem

M. R. Rao, Elsie Sterbin Gottlieb, 1990, Math. Program..

Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices

M. R. Rao, M. Rao, 1976 .

Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure

M. R. Rao, M. Rao, P. Doulliez, 1971 .

On the Direct Search Approach to the Rectilinear Facilities Location Problem

M. R. Rao, M. Rao, 1973 .

Decomposition of Balanced Matrices. Part 1. Introduction

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

175 Years of linear programming

M. R. Rao, Vijay Chandru, M. Rao, 1999 .

Capacity Expansion with Two Producing Regions and Concave Costs

M. R. Rao, M. Rao, C. Fong, 1975 .

The bottleneck transportation problem

Robert Garfinkel, M. R. Rao, M. Rao, 1971 .

When is min cut with negative edges easy to solve? Easy and difficult objective functions for max cut

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

Majority Decisions and Transitivity: Some Special Cases

M. R. Rao, Deepak K. Merchant, 1976 .

AN ALGORITHM FOR THE SEGREGATED STORAGE PROBLEM

M. R. Rao, Alan W. Neebe, 1976 .