Skip to main content
Glama

Related Servers

Alternatives to mcp-optimizer

No user-submitted related servers found.

    Related Servers

    • A
      license
      Not graded
      quality
      D
      maintenance
      Enables solving Constraint Satisfaction Problems (CSP) like N-Queens, graph coloring, and Sudoku, as well as Linear Programming optimization problems through both MCP tools and HTTP API endpoints.
      2
      MIT
    • A
      license
      Not graded
      quality
      D
      maintenance
      MCP-ORTools integrates Google's OR-Tools constraint programming solver with Large Language Models through the MCP, enabling AI models to: Submit and validate constraint models Set model parameters Solve constraint satisfaction and optimization problems Retrieve and analyze solution
      21
      MIT
    • A
      license
      Not graded
      quality
      A
      maintenance
      A Model Context Protocol (MCP) server that exposes MiniZinc constraint solving capabilities to Large Language Models.
      182
      MIT
    • A
      license
      A
      quality
      C
      maintenance
      MCP server exposing Z3 solver API for creating variables, adding constraints, and solving SMT problems with optimization support.
      11
      1
      MIT
    • A
      license
      Not graded
      quality
      Not graded
      maintenance
      An MCP server that enables Large Language Models to interactively create, edit, and solve constraint models using backends like MiniZinc, Z3, PySAT, and Clingo. It bridges natural language with symbolic reasoning for solving complex logical, SAT, SMT, and optimization problems.
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      MCP server for querying and simulating the dispatch plan of a solar PV + battery system in the Chilean electricity market, using deterministic optimization and optional DRL.
      Academic Free v1.1

    TDQS

    B3.4/5.0

    Scored across 13 tools

    Disambiguation3/5

    The three general solvers (linear, integer, mixed integer) overlap significantly since linear programming can also handle integer and binary variables, and mixed integer is essentially a superset of integer. The specialized problem solvers (assignment, transportation, knapsack, etc.) are distinct but could be modeled via the general tools, creating potential confusion. Descriptions help but boundaries are fuzzy.

    Naming Consistency3/5

    Most tools follow a 'solve_*_problem_tool' pattern, but several lack the '_tool' suffix (e.g., solve_mixed_integer_program, solve_traveling_salesman_problem) and one is 'validate_optimization_input' without 'solve' prefix. This inconsistency, while readable, violates a predictable verb_noun pattern.

    Tool Count5/5

    13 tools is well within the ideal 3-15 range. Each tool serves a specific optimization domain, and the count feels appropriate for a server dedicated to mathematical optimization without being overwhelming or sparse.

    Completeness4/5

    The server covers a wide range of classic optimization problems: LP, IP, MIP, assignment, transportation, knapsack, TSP, VRP, job shop, shift scheduling, portfolio, and production planning. Minor gaps exist, such as a generic constraint satisfaction tool or nonlinear optimization, but for the stated purpose the coverage is quite comprehensive.

    Maintenance

    ActivityInactive
    ResponsivenessNo issues