Sethuraman Jay

Jay Sethuraman

Information about the author Jay Sethuraman will soon be added to the site.
Found 9 papers in total
House allocation with fractional endowments
House allocation with fractional endowments
2011
This paper studies a generalization of the well known house allocation problem in...
Stochastic Search in a Forest Revisited
Stochastic Search in a Forest Revisited
2007
We consider a generalization of the model of stochastic search in an out–forest,...
Many-to-one stable matching: Geometry and fairness
Many-to-one stable matching: Geometry and fairness
2006
Baïou and Balinski characterized the stable admissions polytope using a system of...
Stochastic scheduling in an in-forest
Stochastic scheduling in an in-forest
2008
Consider a problem of scheduling activities of a research and development project,...
Efficient algorithms for separated continuous linear programs: The multicommodity flow problem with holding costs and extensions
Efficient algorithms for separated continuous linear programs: The multicommodity flow problem with holding costs and extensions
2005
We give an approximation scheme for separated continuous linear programming problems....
From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: the holding cost objective
From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: the holding cost objective
2003
We design an algorithm for the high-multiplicity job-shop scheduling problem with the...
Integer programming and Arrovian Social Welfare functions
Integer programming and Arrovian Social Welfare functions
2003
We characterize the class of Arrovian Social Welfare Functions (ASWFs) as integer...
Gale–Shapley stable marriage problem revisited: Strategic issues and applications
Gale–Shapley stable marriage problem revisited: Strategic issues and applications
2001
We study strategic issues in the Gale–Shapley stable marriage model. In the...
On a cutting plane heuristic for the stable roommates problem and its applications
On a cutting plane heuristic for the stable roommates problem and its applications
2000
We propose a new cutting plane heuristic for the classical stable roommates problem....
Papers per page: