Giter Club home page Giter Club logo

knapsack01's Introduction

The 0/1 Knapsack Problem (Branch & Bound)

Description

請使用 branch & bound 策略解決 0/1 背包問題。

Input Format

  • 第一行包含兩個正整數
    • 背包大小 ≤5×10^6
    • 物品個數 ≤1000
  • 下一行開始每行包含兩個正整數
    • 物品價值 ≤10^5
    • 物品重量 ≤10^5

Output Format

  • 請輸出最大收益

Hint

請使用 branch & bound 策略,其餘作法(e.g. dynamic programming)不予計分。

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.