IBM® ILOG® CPLEX® offers C, C++, Java, .NET, and Python libraries that solve linear programming (LP) and related problems. Specifically, it solves linearly or quadratically constrained optimization problems where the objective to be optimized can be expressed as a linear function or a convex quadratic function. The variables in the model may be declared as continuous or further constrained to take only integer values.

References in zbMATH (referenced in 2294 articles , 1 standard article )

Showing results 2261 to 2280 of 2294.
Sorted by year (citations)

previous 1 2 3 ... 112 113 114 115 next

  1. Maros, István; Mitra, Gautam: Simplex algorithms (1996)
  2. Mehrotra, Sanjay; Wang, Jen-Shan: Conjugate gradient based implementation of interior point methods for network flow problems (1996)
  3. Mitchell, John E.; Borchers, Brian: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (1996)
  4. Ogryczak, Włodzimierz: A note on modeling multiple choice requirements for simple mixed integer programming solvers (1996)
  5. Ramalhinho Lourenço, Helena: Sevast’yanov’s algorithm for the flow-shop scheduling problem (1996)
  6. Ramudhin, Amar; Marier, Philippe: The generalized shifting bottleneck procedure (1996)
  7. Sayın, Serpil: An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming (1996)
  8. Simantiraki, Evangelia: Unidimensional scaling: A linear programming approach minimizing absolute deviations (1996)
  9. Skorin-Kapov, Darko; Skorin-Kapov, Jadranka; O’Kelly, Morton: Tight linear programming relaxations of uncapacitated (p)-hub median problems (1996)
  10. Sloane, N. J. A.; Stufken, J.: A linear programming bound for orthogonal arrays with mixed levels (1996)
  11. Wunderling, Roland: Parallel and object oriented simplex algorithm (1996)
  12. Andersen, Erling D.; Andersen, Knud D.: Presolving in linear programming (1995)
  13. Bahn, O.; du Merle, O.; Goffin, J.-L.; Vial, J.-P.: A cutting plane method from analytic centers for stochastic programming (1995)
  14. De Simone, C.; Diehl, M.; Jünger, M.; Mutzel, P.; Reinelt, G.; Rinaldi, G.: Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (1995)
  15. Gazmuri, Pedro; Arrate, Ignacio: Modeling and visualization for a production planning decision support system (1995)
  16. Kennington, Jeffery L.; Mohammadi, Farin: The singly constrained assignment problem: An AP basis algorithm (1995)
  17. Lee, C. Y.; Choi, J. Y.: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights (1995)
  18. Le Pape, Claude: An application of constraint programming to a specific production scheduling problem (1995)
  19. Marcotte, P.; Marquis, G.; Savard, G.: A new implicit enumeration scheme for the discriminant analysis problem (1995)
  20. Resende, Mauricio G. C.; Ramakrishnan, K. G.; Drezner, Zvi: Computing lower bounds for the quadratic assignment problem with an interior point algorithm for linear programming (1995)

previous 1 2 3 ... 112 113 114 115 next