XMP

The Design of the XMP Linear Programming Library. XMP is a hierarchically structured library of FORTRAN subroutines for linear programming. Its purpose is to facilitate algorithmic research and model development in operations research and related disciplines. The intended audience for XMP, the design goals that were identified as essential for serving that audience, and the way in which those goals were embodied in a working system, are described. Experience with XMP shows that an LP system can be designed primarily for flexibility and ease of modification without too great a sacrifice in computational efficiency.


References in zbMATH (referenced in 47 articles )

Showing results 1 to 20 of 47.
Sorted by year (citations)

1 2 3 next

  1. Hart, William E.; Watson, Jean-Paul; Woodruff, David L.: Pyomo: modeling and solving mathematical programs in python (2011) ioport
  2. Chao, I-Ming: A tabu search method for the truck and trailer routing problem (2002)
  3. Hansen, Pierre; Jaumard, Brigitte; Poggi de Aragão, Marcus: Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (1998)
  4. Pitaktong, U.; Brockett, P. L.; Mote, J. R.; Rousseau, J. J.: Identification of Pareto-efficient facets in data envelopment analysis (1998)
  5. Sherali, H. D.; Krishnamurthy, R. S.; Al-Khayyal, F. A.: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (1998)
  6. Yu, Chunyan: The effects of exogenous variables in efficiency measurement -- a Monte Carlo study (1998)
  7. Sarker, Ruhul A.; Gunn, Eldon A.: A simple SLP algorithm for solving a class of nonlinear programs (1997)
  8. Ahuja, R. K.; Batra, J. L.; Gupta, S. K.; Punnen, A. P.: Optimal expansion of capacitated transshipment networks (1996)
  9. Dulá, J. H.; Helgason, R. V.: A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space (1996)
  10. Gendreau, M.; Marcotte, P.; Savard, G.: A hybrid tabu-ascent algorithm for the linear bilevel programming problem (1996)
  11. Kall, Peter; Mayer, János: SLP-IOR: An interactive model management system for stochastic linear programs (1996)
  12. Larsson, Torbjörn; Patriksson, Michael; Strömberg, Ann-Brith: Conditional subgradient optimization -- theory and applications (1996)
  13. Sherali, H. D.; Krishnamurthy, R. S.; Al-Khayyal, F. A.: Enhanced intersection cutting-plane approach for linear complementarity problems (1996)
  14. Chao, I-Ming; Golden, Bruce L.; Wasil, Edward A.: A new heuristic for the period traveling salesman problem (1995)
  15. Clarke, Lloyd W.; Anandalingam, G.: A bootstrap heuristic for designing minimum cost survivable networks (1995)
  16. Gélinas, Sylvie; Desrochers, Martin; Desrosiers, Jacques; Solomon, Marius M.: A new branching strategy for time constrained routing problems with application to backhauling (1995)
  17. Klarbring, A.; Petersson, J.; Rönnqvist, M.: Truss topology optimization including unilateral contact (1995)
  18. Berman, Oded; Ganz, Zvi: The capacity expansion problem in the service industry (1994)
  19. Bretthauer, Kurt M.; Cabot, A. Victor: A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (1994)
  20. Bryson, Noel A.; Gass, Saul I.: Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm (1994)

1 2 3 next