Comet (programming language)

Comet is a commercial programming language designed by Brown University professor Dr. Pascal Van Hentenryck used to solve complex combinatorial optimization problems in areas such as resource allocation and scheduling. It offers a range of optimization algorithms: from mathematical programming to constraint programming, local search algorithm and "dynamic stochastic combinatorial optimization."^[1]

Comet programs specify local search algorithms as two components:

a high-level model describing the applications in terms of constraints, constraint combinators, and objective functions;
a search procedure expressed in terms of the model at a high abstraction level.

This approach promotes reusability across applications.

Its API allows it to be used as a software library. Comet also features high-level abstractions for parallel and distributed computing, based on loop scheduling, interruptions, and work stealing.

References

↑ Taylor, J., "First Look - Dynadec Comet", July 8, 2009

External links

Mathematical optimization software

Data formats	LP MPS nl OptML OSiL sol xMPS

Modeling tools	AIMMS AMPL APMonitor CMPL CVX CVXOPT CVXPY ECLiPSe-CLP GAMS GNU MathProg JuMP LINDO OPL MPL OptimJ PICOS PuLP Pyomo ROML TOMLAB Xpress-Mosel YALMIP ZIMPL

LP, MILP^∗ solvers	ABACUS^∗ APOPT^∗ Artelys Knitro^∗ BCP^∗ BDMLP BPMPD BPOPT CLP CBC^∗ CPLEX^∗ CSDP DSDP FortMP^∗ GCG^∗ GIPALS32 GLPK/GLPSOL^∗ Gurobi^∗ HOPDM LINDO^∗ lp_solve^∗ LOQO MINOS MINTO^∗ MOSEK^∗ OOPS OOQP PCx QSopt SAS/OR^∗ SCIP^∗ SoPlex SOPT-IP^∗ Sulum Optimization Tools^∗ SYMPHONY^∗ XA^∗ Xpress-Optimizer^∗

QP, MIQP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT BQPD CBC^∗ CLP CPLEX^∗ FortMP^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LSSOL LOQO MINOS MOSEK^∗ OOPS OOQP QPOPT QPSOL SCIP^∗ XA Quadratic Solver Xpress-Optimizer^∗

QCP, MIQCP^∗ solvers	APOPT^∗ Artelys Knitro^∗ BPMPD BPOPT CPLEX^∗ GloMIQO^∗ Gurobi^∗ IPOPT LINDO^∗ LOQO MINOS MOSEK^∗ SCIP^∗ Xpress-Optimizer^∗ Xpress-SLP^∗

SOCP, MISOCP^∗ solvers	CPLEX^∗ DSDP Gurobi^∗ LINDO^∗ LOQO MOSEK^∗ SCIP^∗ SDPT3 SeDuMi Xpress-Optimizer^∗

SDP, MISDP^∗ solvers	CSDP DSDP MOSEK PENBMI PENSDP SCIP-SDP^∗ SDPA SDPT3 SeDuMi

NLP, MINLP^∗ solvers	ALGENCAN AlphaECP^∗ ANTIGONE^∗ AOA^∗ APOPT^∗ Artelys Knitro^∗ BARON^∗ Bonmin^∗ BPOPT CONOPT Couenne^∗ DICOPT^∗ FilMINT^∗ FilterSQP Galahad library ipfilter IPOPT LANCELOT LINDO^∗ LOQO LRAMBO MIDACO^∗ MILANO^∗ MINLP BB^∗ MINOS Minotaur^∗ MISQP^∗ NLPQLP NPSOL OQNLP^∗ PATHNLP PENNON SBB^∗ SCIP^∗ SNOPT^∗ SQPlab WORHP Xpress-SLP^∗

GO solvers	BARON Couenne^∗ LINDO SCIP

CP solvers	Artelys Kalis Choco Comet CPLEX CP Optimizer Gecode Google CP Solver JaCoP OscaR

Metaheuristic solvers	OptaPlanner LocalSolver

List of optimization software Comparison of optimization software

This article is issued from Wikipedia - version of the 7/7/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.