Entry Johnson:1992:RDF from ibmsysj.bib

Last update: Thu Nov 27 02:08:39 MST 2008                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Johnson:1992:RDF,
  author =       "E. L. Johnson and G. L. Nemhauser",
  title =        "Recent developments and future directions in
                 mathematical programming",
  journal =      j-IBM-SYS-J,
  volume =       "31",
  number =       "1",
  pages =        "79--93",
  year =         "1992",
  CODEN =        "IBMSA7",
  ISSN =         "0018-8670",
  bibdate =      "Tue Mar 19 17:38:46 1996",
  note =         "G321-5463.",
  abstract =     "Advances in mathematical programming methodology have
                 included: development of interior methods competing
                 with the simplex method, improved simplex codes, vastly
                 improved performance for mixed-integer programming
                 using strong linear programming formulations, and a
                 renewed interest in decomposition. In addition, use of
                 vector and parallel processing has improved performance
                 and influenced algorithmic developments. One sees the
                 acceleration of better methods and improved codes
                 moving together with faster, lower-cost, and more
                 interesting hardware into a variety of application
                 areas, thereby opening up new demands for greater
                 function of optimization codes. These new functions
                 might include, for example, more powerful nonlinear
                 codes, decomposition techniques taking advantage of
                 network and other problem-dependent structures, and
                 mixed-integer capability in quadratic and general
                 nonlinear problems. Stochastic scenario programming and
                 multitime-period problems are becoming solvable and
                 open up applications and algorithmic challenges. The
                 IBM Optimization Subroutine Library has helped to
                 accelerate these changes but will have to continue to
                 change and expand in ways that are touched upon in this
                 paper.",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown
                 Heights, NY, USA",
  classification = "C1180 (Optimisation techniques)",
  keywords =     "Decomposition; IBM Optimization Subroutine Library;
                 Interior methods; Linear programming; Mathematical
                 programming methodology; Mixed-integer programming;
                 Multitime-period problems; Nonlinear codes;
                 Optimization codes; Parallel processing; Simplex
                 method; Stochastic scenario programming; Vector
                 processing",
  language =     "English",
  pubcountry =   "USA",
  thesaurus =    "Mathematical programming; Parallel processing;
                 Subroutines",
}

Related entries