A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (Q2899132): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.1100.0406 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124475618 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts |
scientific article |
Statements
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts (English)
0 references
28 July 2012
0 references
bin packing problem with conflicts
0 references
branch and price
0 references
Lagrangean relaxation
0 references
maximal clique inequalities
0 references
