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.
Keywords for this software
References in zbMATH (referenced in 2766 articles , 1 standard article )
Showing results 1 to 20 of 2766.
Sorted by year (citations)
- Alkhaleel, Basem A.; Liao, Haitao; Sullivan, Kelly M.: Risk and resilience-based optimal post-disruption restoration for critical infrastructures under uncertainty (2022)
- Andrés-Thió, Nicolau; Brazil, Marcus; Ras, Charl; Thomas, Doreen; Volz, Marcus: An exact algorithm for constructing minimum Euclidean skeletons of polygons (2022)
- Azizi, Nader; Salhi, Said: Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor (2022)
- Beasley, J. E.: A discrete optimisation approach for target path planning whilst evading sensors (2022)
- Ben Amor, Nahla; Fargier, Hélène; Sabbadin, Régis; Trabelsi, Meriem: Solving possibilistic games with incomplete information (2022)
- Bentobache, Mohand; Telli, Mohamed; Mokhtari, Abdelkader: New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (2022)
- Berger, Mathias; Radu, David; Dubois, Antoine; Pandžić, Hrvoje; Dvorkin, Yury; Louveaux, Quentin; Ernst, Damien: Siting renewable power generation assets with combinatorial optimisation (2022)
- Blekherman, Grigoriy; Dey, Santanu S.; Shu, Kevin; Sun, Shengding: Hyperbolic relaxation of (k)-locally positive semidefinite matrices (2022)
- Bruglieri, Maurizio; Cordone, Roberto; Liberti, Leo: Maximum feasible subsystems of distance geometry constraints (2022)
- Bushaj, Sabah; Büyüktahtakın, İ. Esra; Haight, Robert G.: Risk-averse multi-stage stochastic optimization for surveillance and operations planning of a forest insect infestation (2022)
- Carvalho, Desiree M.; Nascimento, Mariá C. V.: Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (2022)
- Ceselli, Alberto; Létocart, Lucas; Traversi, Emiliano: Dantzig-Wolfe reformulations for binary quadratic problems (2022)
- De Rosa, Antonio; Khajavirad, Aida: The ratio-cut polytope and K-means clustering (2022)
- Dias, Fernando H. C.; Hijazi, Hassan; Rey, David: Disjunctive linear separation conditions and mixed-integer formulations for aircraft conflict resolution (2022)
- Drezner, Zvi; Kalczynski, Pawel; Misevičius, Alfonsas; Palubeckis, Gintaras: Finding optimal solutions to several gray pattern instances (2022)
- Edis, Emrah B.; Sancar Edis, Rahime; Ilgin, Mehmet Ali: Mixed integer programming approaches to partial disassembly line balancing and sequencing problem (2022)
- Fakhry, Ramy; Hassini, Elkafi; Ezzeldin, Mohamed; El-Dakhakhni, Wael: Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure (2022)
- García-Marco, Ignacio; Knauer, Kolja: On sensitivity in bipartite Cayley graphs (2022)
- Kalczynski, Pawel; Drezner, Zvi: Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location (2022)
- Karakostas, Panagiotis; Sifaleras, Angelo; Georgiadis, Michael C.: Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (2022)