default search action
M. R. Rao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j37]Atlanta Chakraborty, Vijay Chandru, M. R. Rao
:
A linear programming primer: from Fourier to Karmarkar. Ann. Oper. Res. 287(2): 593-616 (2020)
2010 – 2019
- 2014
- [p4]Vijay Chandru, M. R. Rao:
Combinatorial Optimization. Computing Handbook, 3rd ed. (1) 2014: 13: 1-47
2000 – 2009
- 2004
- [p3]Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan:
Protein Folding on Lattices: An Integer Programming Approach. The Sharpest Cut 2004: 185-196 - 2003
- [j36]S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi
Easy and difficult objective functions for max cut. Math. Program. 94(2-3): 459-466 (2003)
1990 – 1999
- 1999
- [j35]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Balanced Matrices. J. Comb. Theory B 77(2): 292-406 (1999) - [p2]Vijay Chandru, M. R. Rao:
Integer Programming. Algorithms and Theory of Computation Handbook 1999 - [p1]Vijay Chandru, M. R. Rao:
Linear Programming. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j34]A. K. Rao, M. R. Rao:
Solution procedures for sizing of warehouses. Eur. J. Oper. Res. 108(1): 16-25 (1998) - 1997
- [r1]Vijay Chandru, M. R. Rao:
Combinatorial Optimization. The Computer Science and Engineering Handbook 1997: 316-354 - 1996
- [j33]Vijay Chandru, M. R. Rao:
Combinatorial Optimization: An Integer Programming Perspective. ACM Comput. Surv. 28(1): 55-58 (1996) - 1995
- [j32]Sunil Chopra
Facets of the K-partition Polytope. Discret. Appl. Math. 61(1): 27-48 (1995) - [j31]Michele Conforti, Gérard Cornuéjols, M. R. Rao:
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discret. Appl. Math. 62(1-3): 103-117 (1995) - 1994
- [j30]Sunil Chopra
The Steiner tree problem I: Formulations, compositions and extension of facets. Math. Program. 64: 209-229 (1994) - [j29]Sunil Chopra
The Steiner tree problem II: Properties and classes of facets. Math. Program. 64: 231-246 (1994) - 1993
- [j28]Sunil Chopra
The partition problem. Math. Program. 59: 87-115 (1993) - [j27]Michele Conforti, M. R. Rao:
Testing balancedness and perfection of linear matrices. Math. Program. 61: 1-18 (1993) - 1992
- [j26]Michele Conforti, M. R. Rao:
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets. Discret. Math. 104(1): 23-47 (1992) - [j25]Michele Conforti, M. R. Rao:
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations. Discret. Math. 110(1-3): 81-118 (1992) - [j24]Sunil Chopra
Solving the Steiner Tree Problem on a Graph Using Branch and Cut. INFORMS J. Comput. 4(3): 320-335 (1992) - [j23]Michele Conforti, M. R. Rao:
Properties of balanced and perfect matrices. Math. Program. 55: 35-47 (1992) - [j22]Michele Conforti, M. R. Rao:
Structural properties and decomposition of linear balanced matrices. Math. Program. 55: 129-168 (1992) - 1991
- [j21]Michele Conforti, M. R. Rao, Antonio Sassano
The equipartition polytope. I: Formulations, dimension and basic facets. Math. Program. 49: 49-70 (1991) - [j20]Michele Conforti, M. R. Rao, Antonio Sassano
The equipartition polytope. II: Valid inequalities and facets. Math. Program. 49: 71-90 (1991) - [j19]Sunil Chopra
On the multiway cut polyhedron. Networks 21(1): 51-89 (1991) - 1990
- [j18]Suresh P. Sethi, Chelliah Sriskandarajah, Giri Kumar Tayi, M. R. Rao:
Heuristic Methods for Selection and Ordering of Part-Orienting Devices. Oper. Res. 38(1): 84-98 (1990) - [j17]Elsie Sterbin Gottlieb, M. R. Rao:
The Generalized Assignment Problem: Valid Inequalities and Facets. Math. Program. 46: 31-52 (1990) - [j16]Elsie Sterbin Gottlieb, M. R. Rao:
(1, k)-Configuration Facets for the Generalized Assignment Problem. Math. Program. 46: 53-60 (1990)
1980 – 1989
- 1989
- [j15]Michele Conforti, M. R. Rao:
Odd cycles and matrices with integrality properties. Math. Program. 45(1-3): 279-294 (1989) - 1987
- [j14]Michele Conforti, M. R. Rao:
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem. Math. Oper. Res. 12(2): 193-204 (1987) - [j13]Michele Conforti, M. R. Rao:
Structural properties and recognition of restricted and strongly unimodular matrices. Math. Program. 38(1): 17-27 (1987) - 1983
- [j12]Alan W. Neebe, M. R. Rao:
The Discrete-Time Sequencing Expansion Problem. Oper. Res. 31(3): 546-558 (1983) - [j11]D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets. Math. Oper. Res. 8(4): 579-589 (1983) - [j10]D. Chinhyung Cho, Manfred W. Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems. Math. Oper. Res. 8(4): 590-612 (1983) - 1982
- [j9]Manfred W. Padberg, M. R. Rao:
Odd Minimum Cut-Sets and b-Matchings. Math. Oper. Res. 7(1): 67-80 (1982) - 1980
- [j8]M. R. Rao:
Technical Note - A Note on the Multiple Traveling Salesmen Problem. Oper. Res. 28(3-Part-I): 628-632 (1980)
1970 – 1979
- 1976
- [j7]M. R. Rao:
Optimal Capacity Expansion with Inventory. Oper. Res. 24(2): 291-300 (1976) - 1975
- [j6]P. J. Doulliez, M. R. Rao:
Optimal Network Capacity Planning: A Shortest-Path Scheme. Oper. Res. 23(4): 810-818 (1975) - 1974
- [j5]Manfred W. Padberg, M. R. Rao:
The travelling salesman problem and a class of polyhedra of diameter two. Math. Program. 7(1): 32-45 (1974) - 1973
- [j4]R. Jagannathan, M. R. Rao:
Technical Note - A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints. Oper. Res. 21(1): 360-364 (1973) - [j3]M. R. Rao:
Technical Note - Some Comments on "Linear" Programming with Absolute-Value Functionals. Oper. Res. 21(1): 373-374 (1973) - 1971
- [j2]P. J. Doulliez, M. R. Rao:
Capacity of a Network with Increasing Demands and Arcs Subject to Failure. Oper. Res. 19(4): 905-915 (1971)
1960 – 1969
- 1968
- [j1]M. R. Rao, Stanley Zionts:
Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems. Oper. Res. 16(1): 52-63 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: