Advanced Search
DSpace@MIT

Browsing Operations Research Center by Title

Research and Teaching Output of the MIT Community

Browsing Operations Research Center by Title

Sort by: Order: Results:

  • Bertsimas, Dimitris J.; Nakazato, Daisuke (Massachusetts Institute of Technology, Operations Research Center, 1991)
  • Gartner, Nathan H.; Little, John D. C. (Massachusetts Institute of Technology, Operations Research Center, 1973-08)
    A procedure is described for determining optimal signal settings in a network including cycle time, splits of green time and ffsets. A number of cycle times are scanned in the process. For each cycle, splits are determined ...
  • Hammond, Janice H.; Magnanti, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1985-08)
    We consider generalizations of the steepest descent algorithm for solving asymmetric systems of equations. We first show that if the system is linear and is defined by a matrix M, then the method converges if M2 is positive ...
  • Magnanti, Thomas L.; Shapiro, Jeremy F., 1939-; Wagner, Michael H. (Massachusetts Institute of Technology, Operations Research Center, 1973-09)
    The generalized linear programming algorithm allows an arbitrary mathematical programming minimization problem to be analyzed as a sequence of linear programming approximations. Under fairly general assumptions, it is ...
  • Gugenheim, Elie; Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1982-06)
    Not Available
  • Patel, Nitin R.; Karmarkar, Uday S. (Massachusetts Institute of Technology, Operations Research Center, 1973-09)
    This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and decoupled newsboy ...
  • Kaminski, Kathryn Margaret (Massachusetts Institute of Technology, 2007)
    Investors commonly use stopping rules to help them get in and out of their investment positions. Despite their widespread use and support from behavioral finance, there has been little discussion of their impact on portfolio ...
  • Freund, Robert M.; Belloni, Alexandre (Massachusetts Institute of Technology, Operations Research Center, 2009-02-03)
  • Morse, Philip M., 1903- (Massachusetts Institute of Technology, Operations Research Center, 1976-02)
    Both the geometric and the Bradford probability distributions are used to describe collections of items of interest in information science. Each unit item has a productivity, an integer n measuring the amount of use of the ...
  • Dunkel, Juliane (Massachusetts Institute of Technology, 2011)
    In this thesis, we examine theoretical aspects of the Gomory-Chvátal closure of polyhedra. A Gomory-Chvátal cutting plane for a polyhedron P is derived from any rational inequality that is valid for P by shifting the ...
  • Von Nordenflycht, Andrew Gustaf, 1969- (Massachusetts Institute of Technology, 2004)
    Theorists suggest the rising value of human capital will mean greater participation by employees in the ownership and governance of firms. This thesis explores aspects of these claims by analyzing the competitive effects ...
  • Letham, Benjamin; Heller, Katherine A.; Rudin, Cynthia (Massachusetts Institute of Technology, Operations Research Center, 2012-08-21)
  • Gaudet, Megan Brett (Massachusetts Institute of Technology, 2008)
    The purpose of this thesis is to explore various harmonization scenarios for North Atlantic en route user charges. The current charging system involves eight countries, each with their own method for computing user charges. ...
  • Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1993-01)
    We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...
  • Balakrishnan, Anantaram; Magnanti, Thomas L.; Mirchandani, Prakash (Massachusetts Institute of Technology, Operations Research Center, 1994-01)
    We study a class of models, known as overlay optimization problems, with a "base" subproblem and an "overlay" subproblem, linked by the requirement that the overlay solution be contained in the base solution. In some ...
  • Malasky, Jeremy S (Massachusetts Institute of Technology, 2005)
    Numerous complex real-world applications are either theoretically intractable or unable to be solved in a practical amount of time. Researchers and practitioners are forced to implement heuristics in solving such problems ...
  • Marsten, Roy E.; Morin, Thomas L. (Massachusetts Institute of Technology, Operations Research Center, 1976-03)
    The dynamic programming and branch-and-bound approaches are combined to produce a hybrid algorithm for separable discrete mathematical programs. The hybrid algorithm uses linear programming in a novel way to compute bounds ...
  • Gau, Shiow-Hwa; Larson, Richard C., 1943-; Massachusetts Institute of Technology. Operations Research Center (Massachusetts Institute of Technology, Operations Research Center, 1988)
  • Yamanaka, Shiro, 1975- (Massachusetts Institute of Technology, 2005)
    The purpose of this thesis is to estimate the impact of infrastructure-related add-on taxes and fees on the direct cost of air travel in the United States and the European Union. Its scope includes domestic travel in the ...
MIT-Mirage