M. R. Rao

41 papers Journal 37
YearRankTypeTitle / Venue / Authors
2020 J jnl
A linear programming primer: from Fourier to Karmarkar.
Ann. Oper. Res.
Atlanta Chakraborty, Vijay Chandru, M. R. Rao
2014 — ch.
Combinatorial Optimization.
Computing Handbook, 3rd ed. (1)
Vijay Chandru, M. R. Rao
2003 J jnl
Easy and difficult objective functions for max cut.
Math. Program.
S. Thomas McCormick, M. R. Rao, Giovanni Rinaldi
1999 J jnl
Decomposition of Balanced Matrices.
J. Comb. Theory B
Michele Conforti, Gérard Cornuéjols, M. R. Rao
1999 — ch.
Integer Programming.
Algorithms and Theory of Computation Handbook
Vijay Chandru, M. R. Rao
1999 — ch.
Linear Programming.
Algorithms and Theory of Computation Handbook
Vijay Chandru, M. R. Rao
1998 J jnl
Solution procedures for sizing of warehouses.
Eur. J. Oper. Res.
A. K. Rao, M. R. Rao
1997 — ch.
Combinatorial Optimization.
The Computer Science and Engineering Handbook
Vijay Chandru, M. R. Rao
1996 J jnl
Combinatorial Optimization: An Integer Programming Perspective.
ACM Comput. Surv.
Vijay Chandru, M. R. Rao
1995 J jnl
Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs.
Discret. Appl. Math.
Michele Conforti, Gérard Cornuéjols, M. R. Rao
1995 J jnl
Facets of the K-partition Polytope.
Discret. Appl. Math.
Sunil Chopra, M. R. Rao
1994 J jnl
The Steiner tree problem I: Formulations, compositions and extension of facets.
Math. Program.
Sunil Chopra, M. R. Rao
1994 J jnl
The Steiner tree problem II: Properties and classes of facets.
Math. Program.
Sunil Chopra, M. R. Rao
1993 J jnl
Testing balancedness and perfection of linear matrices.
Math. Program.
Michele Conforti, M. R. Rao
1993 J jnl
The partition problem.
Math. Program.
Sunil Chopra, M. R. Rao
1992 J jnl
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets.
Discret. Math.
Michele Conforti, M. R. Rao
1992 J jnl
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations.
Discret. Math.
Michele Conforti, M. R. Rao
1992 J jnl
Properties of balanced and perfect matrices.
Math. Program.
Michele Conforti, M. R. Rao
1992 J jnl
Solving the Steiner Tree Problem on a Graph Using Branch and Cut.
INFORMS J. Comput.
Sunil Chopra, Edgar R. Gorres, M. R. Rao
1992 J jnl
Structural properties and decomposition of linear balanced matrices.
Math. Program.
Michele Conforti, M. R. Rao
1991 J jnl
On the multiway cut polyhedron.
Networks
Sunil Chopra, M. R. Rao
1991 J jnl
The equipartition polytope. I: Formulations, dimension and basic facets.
Math. Program.
Michele Conforti, M. R. Rao, Antonio Sassano
1991 J jnl
The equipartition polytope. II: Valid inequalities and facets.
Math. Program.
Michele Conforti, M. R. Rao, Antonio Sassano
1990 J jnl
(1, k)-Configuration Facets for the Generalized Assignment Problem.
Math. Program.
Elsie Sterbin Gottlieb, M. R. Rao
1990 J jnl
Heuristic Methods for Selection and Ordering of Part-Orienting Devices.
Oper. Res.
Suresh P. Sethi, Chelliah Sriskandarajah, Giri Kumar Tayi, M. R. Rao
1990 J jnl
The Generalized Assignment Problem: Valid Inequalities and Facets.
Math. Program.
Elsie Sterbin Gottlieb, M. R. Rao
1989 J jnl
Odd cycles and matrices with integrality properties.
Math. Program.
Michele Conforti, M. R. Rao
1987 J jnl
Some New Matroids on Graphs: Cut Sets and the Max Cut Problem.
Math. Oper. Res.
Michele Conforti, M. R. Rao
1987 J jnl
Structural properties and recognition of restricted and strongly unimodular matrices.
Math. Program.
Michele Conforti, M. R. Rao
1983 J jnl
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets.
Math. Oper. Res.
D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao
1983 J jnl
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems.
Math. Oper. Res.
D. Chinhyung Cho, Manfred W. Padberg, M. R. Rao
1983 J jnl
The Discrete-Time Sequencing Expansion Problem.
Oper. Res.
Alan W. Neebe, M. R. Rao
1982 J jnl
Odd Minimum Cut-Sets and
Math. Oper. Res.
Manfred W. Padberg, M. R. Rao
1980 J jnl
Technical Note - A Note on the Multiple Traveling Salesmen Problem.
Oper. Res.
M. R. Rao
1976 J jnl
Optimal Capacity Expansion with Inventory.
Oper. Res.
M. R. Rao
1975 J jnl
Optimal Network Capacity Planning: A Shortest-Path Scheme.
Oper. Res.
P. J. Doulliez, M. R. Rao
1974 J jnl
The travelling salesman problem and a class of polyhedra of diameter two.
Math. Program.
Manfred W. Padberg, M. R. Rao
1973 J jnl
Technical Note - A Class of Nonlinear Chance-Constrained Programming Models with Joint Constraints.
Oper. Res.
R. Jagannathan, M. R. Rao
1973 J jnl
Technical Note - Some Comments on "Linear" Programming with Absolute-Value Functionals.
Oper. Res.
M. R. Rao
1971 J jnl
Capacity of a Network with Increasing Demands and Arcs Subject to Failure.
Oper. Res.
P. J. Doulliez, M. R. Rao
1968 J jnl
Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems.
Oper. Res.
M. R. Rao, Stanley Zionts
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling