CPLEX

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 2479 articles , 1 standard article )

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

previous 1 2 3 ... 112 113 114 115 116 ... 122 123 124 next

  1. Diggavi, Suhas N.; Sloane, N. J. A.; Vaishampayan, Vinay A.: Asymmetric multiple description lattice vector quantizers. (2002)
  2. Erlebach, Thomas; Jansen, Klaus: Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees (2002)
  3. Focacci, Filippo; Lodi, Andrea; Milano, Michela: Embedding relaxations in global constraints for solving TSP and TSPTW (2002)
  4. Focacci, Filippo; Lodi, Andrea; Milano, Michela: Optimization-oriented global constraints (2002)
  5. Fourer, Robert; Gay, David M.: Extending an algebraic modeling language to support constraint programming (2002)
  6. Gabrel, V.; Minoux, M.: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (2002)
  7. Guerriero, F.; Tseng, P.: Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (2002)
  8. Israeli, Eitan; Wood, R. Kevin: Shortest-path network interdiction (2002)
  9. Jaumard, Brigitte; Marcotte, Odile; Meyer, Christophe; Vovor, Tsevi: Erratum to “Comparison of column generation models for channel assignment in cellular networks” (2002)
  10. Jørgensen, David Grove; Meyling, Morten: A branch-and-price algorithm for switch-box routing (2002)
  11. Lawphongpanich, Siriphong: A nontangential cutting plane algorithm (2002)
  12. Lebbah, Yahia; Lhomme, Olivier: Accelerating filtering techniques for numeric CSPs (2002)
  13. Leyton-Brown, Kevin; Nudelman, Eugene; Shoham, Yoav: Learning the empirical hardness of optimization problems: the case of combinatorial auctions (2002) ioport
  14. Lim, Sungmook; Park, Soondal: LPAKO: A simplex-based linear programming program (2002)
  15. Lorigeon, T.; Billaut, J.-C.; Bouquard, J.-L.: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint (2002)
  16. Mangasarian, O. L.; Musicant, David R.: Large scale kernel regression via linear programming (2002)
  17. Marchand, Hugues; Martin, Alexander; Weismantel, Robert; Wolsey, Laurence: Cutting planes in integer and mixed integer programming (2002)
  18. Ottosson, Greger; Thorsteinsson, Erlendur S.; Hooker, John N.: Mixed global constraints and inference in hybrid CLP--IP solvers (2002)
  19. Podnar, Hrvoje; Skorin-Kapov, Jadranka; Skorin-Kapov, Darko: Network cost minimization using threshold-based discounting (2002)
  20. Prytz, Mikael; Forsgren, Anders: Dimensioning multicast-enabled communications networks (2002)

previous 1 2 3 ... 112 113 114 115 116 ... 122 123 124 next