Showing 3 open source projects for "knapsack problem"

View related business solutions
  • Veeam Data Platform v13.1 Icon
    Veeam Data Platform v13.1

    Move workloads across hypervisors and clouds with no vendor lock-in. Try VDP free today.

    Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
    Try Now
  • Paessler - Monitor Your Whole Network in Minutes Icon
    Paessler - Monitor Your Whole Network in Minutes

    Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

    Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
    Start Free 30-Day Trial
  • 1
    OR-Tools - Google Optimization Tools

    OR-Tools - Google Optimization Tools

    Google's software suite for combinatorial optimization

    Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....
    Downloads: 11 This Week
    Last Update:
    See Project
  • 2
    Opt4J

    Opt4J

    Modular Java framework for meta-heuristic optimization

    ...It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    KNAPSACK-2D: euristic solution to bidimensional knapsack problem
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next