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 1596 articles , 1 standard article )
Showing results 1 to 20 of 1596.
Sorted by year (- Glenn, Paul; Menasco, William W.; Morrell, Kayla; Morse, Matthew J.: MICC: A tool for computing short distances in the curve complex (2017)
- Adasme, Pablo; Lisser, Abdel: Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks (2016)
- Akkan, Can; Erdem Külünk, M.; Koçaş, Cenk: Finding robust timetables for project presentations of student teams (2016)
- Alabdulmohsin, Ibrahim; Cisse, Moustapha; Gao, Xin; Zhang, Xiangliang: Large margin classification with indefinite similarities (2016)
- Ambrosino, Daniela; Sciomachen, Anna: A capacitated hub location problem in freight logistics multimodal networks (2016)
- Arıkan, Uğur; Gürel, Sinan; Aktürk, M.Selim: Integrated aircraft and passenger recovery with cruise time controllability (2016)
- Bang, Sungwan; Eo, Soo-Heang; Cho, Yong Mee; Jhun, Myoungshic; Cho, HyungJun: Non-crossing weighted kernel quantile regression with right censored data (2016)
- Barketau, Maksim; Pesch, Erwin; Shafransky, Yakov: Scheduling dedicated jobs with variative processing times (2016)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (2016)
- Blum, Christian; Blesa, Maria J.: Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem (2016)
- Blum, Christian; Raidl, Günther R.: Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (2016)
- Boland, Natashia; Clement, Riley; Waterer, Hamish: A bucket indexed formulation for nonpreemptive single machine scheduling problems (2016)
- Branda, Martin: Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour (2016)
- Brás, Carmo; Eichfelder, Gabriele; Júdice, Joaquim: Copositivity tests based on the linear complementarity problem (2016)
- Braun, Gábor; Pokutta, Sebastian: A polyhedral characterization of border bases (2016)
- Buchheim, Christoph; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco; Trieu, Long: A feasible active set method with reoptimization for convex quadratic mixed-integer programming (2016)
- Chen, Jinchao; Du, Chenglie; Xie, Fei; Yang, Zhenkun: Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems (2016)
- Cire, Andre A.; Hooker, John N.; Yunes, Tallys: Modeling with metaconstraints and semantic typing of variables (2016)
- Diabat, Ali; Abdallah, Tarek; Le, Tung: A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods (2016)
- Dong, Hongbo: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (2016)