A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint Full article
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2018, Volume: 871, Pages: 309-320 Pages count : 12 DOI: 10.1007/978-3-319-93800-4_25 | ||||
| Tags | Branch-and-price; Column generation; Matheuristic | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Kondakov A.
, Kochetov Y.
A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint
Communications in Computer and Information Science. 2018. V.871. P.309-320. DOI: 10.1007/978-3-319-93800-4_25 Scopus OpenAlex
A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint
Communications in Computer and Information Science. 2018. V.871. P.309-320. DOI: 10.1007/978-3-319-93800-4_25 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85049668595 |
| OpenAlex: | W2807799903 |