| |||||||||||||
Multi-knapsack - Constraint formulation alternatives Description The problem asks for assigning a set of items to multiple knapsacks with
the objective to maximize profit while respecting the per-knapsack weight
restrictions. Each knapsack has a capacity that limits the weight of items
that can be put into it. The capacity can be extended by a constant at a
fixed cost. The model shows several formulation options depending on
whether data is provided by arrays or by collections.
Source Files By clicking on a file name, a preview is opened at the bottom of this page.
MultipleKnapsack.csproj <Project Sdk="Microsoft.NET.Sdk"> <PropertyGroup> <OutputType>Exe</OutputType> <TargetFramework>net5.0</TargetFramework> <IsPackable>false</IsPackable> <XpressExampleFiles Condition="'$(XpressExampleFiles)'==''">../../../data</XpressExampleFiles> </PropertyGroup> <ItemGroup> <PackageReference Include="FICO.Xpress.XPRSdn" Version="41.1.1" /> <!-- Version 41.1.1 or later --> </ItemGroup> </Project> | |||||||||||||
© Copyright 2024 Fair Isaac Corporation. |