A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
10.1016/j.ejor.2018.04.014
Saved in:
Main Authors: | Lijun Wei, Qian Hu, LIM LEONG CHYE, ANDREW, Qiang Liu |
---|---|
Other Authors: | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT |
Format: | Article |
Language: | English |
Published: |
Elsevier
2020
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/167647 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Branch and bound on the network model
by: Jain, S.
Published: (2013) -
SUBSET SELECTION USING BRANCH AND BOUND FORREGRESSION
by: SANDEEP SETHURAMAN
Published: (2019) -
A branch-and-price algorithm for the two-dimensional vector packing problem
by: Lijun Wei, et al.
Published: (2020) -
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
by: Tian Liu, et al.
Published: (2020) -
A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
by: LI CHONGSHOU, et al.
Published: (2020)