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 2641 articles , 1 standard article )
Showing results 1 to 20 of 2641.
Sorted by year (citations)
- Abdolali, Maryam; Gillis, Nicolas: Simplex-structured matrix factorization: sparsity-based identifiability and provably correct algorithms (2021)
- Ahmadian, Mohammad Mahdi; Salehipour, Amir; Cheng, T. C. E.: A meta-heuristic to solve the just-in-time job-shop scheduling problem (2021)
- Álvarez-Miranda, Eduardo; Sinnl, Markus: Exact and heuristic algorithms for the weighted total domination problem (2021)
- Antoine Prouvost, Justin Dumouchelle, Maxime Gasse, Didier Chételat, Andrea Lodi: Ecole: A Library for Learning Inside MILP Solvers (2021) arXiv
- Arık, Oğuzhan Ahmet: Long-term plantation and harvesting planning for industrial plantation forest areas (2021)
- Baggio, Andrea; Carvalho, Margarida; Lodi, Andrea; Tramontani, Andrea: Multilevel approaches for the critical node problem (2021)
- Bergman, David; Lozano, Leonardo: Decision diagram decomposition for quadratically constrained binary optimization (2021)
- Casazza, Marco; Ceselli, Alberto: Optimization algorithms for resilient path selection in networks (2021)
- Casazza, Marco; Ceselli, Alberto; Wolfler Calvo, Roberto: A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (2021)
- Castro, Jordi; Nasini, Stefano: A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks (2021)
- Castro, Jordi; Sarachaga, Fernando: An online optimization-based procedure for the assignment of airplane seats (2021)
- Çavuş, Özlem; Kocaman, Ayse Selin; Yılmaz, Özlem: A risk-averse approach for the planning of a hybrid energy system with conventional hydropower (2021)
- Dandurand, Brian C.; Kim, Kibaek; Leyffer, Sven: A bilevel approach for identifying the worst contingencies for nonconvex alternating current power systems (2021)
- Dan, Teodora; Lodi, Andrea; Marcotte, Patrice: An exact algorithmic framework for a class of mixed-integer programs with equilibrium constraints (2021)
- Dias, Gustavo; Liberti, Leo: Exploiting symmetries in mathematical programming via orbital independence (2021)
- Edis, Emrah B.: Constraint programming approaches to disassembly line balancing problem with sequencing decisions (2021)
- Elloumi, Sourour; Hudry, Olivier; Marie, Estel; Martin, Agathe; Plateau, Agnès; Rovedakis, Stéphane: Optimization of wireless sensor networks deployment with coverage and connectivity constraints (2021)
- Fakhri, Ashkan; Fragkogios, Antonios; Saharidis, Georgios K. D.: An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem (2021)
- Gangammanavar, Harsha; Liu, Yifan; Sen, Suvrajeet: Stochastic decomposition for two-stage stochastic linear programs with random cost coefficients (2021)
- Gopalswamy, Karthick; Uzsoy, Reha: Conic programming models for production planning with clearing functions: formulations and duality (2021)