MARATTO

article · Expert Systems with Applications

Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups

In plain language

No abstract is available for this record, so no summary has been generated.

Research topics

  • Optimization and Packing Problems
  • Advanced Manufacturing and Logistics Optimization
  • Vehicle Routing Optimization Methods

Read the original research

This page summarises published work. The authoritative version sits with the publisher.

DOI: 10.1016/j.eswa.2023.122835

Is something wrong with this record? Report it or request removal.

Discussion

Discuss this research

Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.

No discussion yet. Open the first thread.