Advanced Search
DSpace@MIT

Browsing Operations Research Center Working Papers by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center Working Papers by Title

Sort by: Order: Results:

  • Van Hoesel, Stan; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1990-11)
    In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation ...
  • Magnanti, Thomas L.; Stratila, Dan (2006-03-13)
  • Magnanti, Thomas L.; Stratila, Dan (Massachusetts Institute of Technology, Operations Research Center, 2012-01-18)
  • Letham, Benjamin; Rudin, Cynthia; Madigan, David (Massachusetts Institute of Technology, Operations Research Center, 2012-08-29)
  • Golden, Bruce L., 1950- (Massachusetts Institute of Technology, Operations Research Center, 1975-10)
    In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
  • Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1990-04)
    We study a specialized version of network design problems that arise in telecommunication, transportation and other industries. The problem, a generalization of the shortest path problem, is defined on an undirected network ...
  • Goemans, Michel X.; Queyranne, Maurice; Schulz, Andreas S.; Skutella, Martin; Wang, Yaoguang (Massachusetts Institute of Technology, Operations Research Center, 1999-10)
    We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a ...
  • Morse, Philip M., 1903- (Massachusetts Institute of Technology, Operations Research Center, 1977-12)
    The well-known variational principle of the optimal distribution of search effort is applied to the case where the sought-for target has been located momentarily but the search cannot begin until a time T o later, during ...
  • Magnanti, Thomas L.; Perakis, Georgia; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1997)
  • Green, Curtis; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1974-02)
    Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...
  • Green, Curtis; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1974-08)
    Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...
  • Freund, Robert M.; Vera, Jorge R. (Massachusetts Institute of Technology, Operations Research Center, 1995-10)
    A conic linear system is a system of the form P: find x that solves b- Ax E Cy, E Cx, where Cx and Cy are closed convex cones, and the data for the system is d = (A, b). This system is"well-posed" to the extent that (small) ...
  • Bienstock, Daniel; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1985)
  • Ahuja, Ravindra K., 1956-; Magnanti, Thomas L.; Orlin, James B., 1953- (Massachusetts Institute of Technology, Operations Research Center, 1989-10)
    The literature on network flow problems is extensive, and over the past 40 years researchers have made continuous improvements to algorithms for solving several classes of problems. However, the surge of activity on the ...
  • Nagurney, Anna; Eydeland, Alexander (Massachusetts Institute of Technology, Operations Research Center, 1990-07)
    In this paper we introduce a general parallelizable computational method for solving a wide spectrum of constrained matrix problems. The constrained matrix problem is a core problem in numerous applications in economics. ...
  • Bertsimas, Dimitris J.; Gamarnik, David; Tsitsiklis, John N. (Massachusetts Institute of Technology, Operations Research Center, 1995)
  • Golden, Bruce L., 1950- (Massachusetts Institute of Technology, Operations Research Center, 1976-04)
    This paper is an example of the growing interface between statistics and mathematical optimization. A very efficient heuristic algorithm for the combinatorially intractable TSP is presented, from which statistical estimates ...
  • Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1976-02)
    A number of energy planning models have been proposed for combining econometric submodels which forecast the supply and demand for energy commodities with a linear programming submodel which optimizes the processing and ...
  • Bertsimas, Dimitris J.; van Ryzin, Garrett (Massachusetts Institute of Technology, Operations Research Center, 1990)
  • Bertsimas, Dimitris J.; Ryzin, Garrett van (Massachusetts Institute of Technology, Operations Research Center, 1990-08)
    In a previous paper [12], we introduced a new model for stochastic and dynamic vehicle routing called the dynamic traveling repairman problem (DTRP), in which a vehicle traveling at constant velocity in a Euclidean region ...
MIT-Mirage