10.1287/ijoc.2018.0867

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

2020Volume 32 · Issue 2pp. 428-443
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.