A customized branch-and-bound approach for irregular shape nesting
type: Item
instance of: scholarly article
title: A customized branch-and-bound approach for irregular shape nesting
zbMATH Open document ID: 1405.90113
author: Akang Wang
author: Christopher L. Hanselman
author: Chrysanthos E. Gounaris
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6928833
zbMATH Keywords: nesting problem
zbMATH Keywords: irregular strip packing
zbMATH Keywords: global optimization
zbMATH Keywords: reverse convex quadratic constraints
describes a project that uses: TOPOS
describes a project that uses: GloMIQO
describes a project that uses: SCIP
describes a project that uses: LINDO
MaRDI profile type: Publication
full work available at URL: s10898-018-0637-y
OpenAlex ID: W2792533437
cites work: SCIP: solving constraint integer programs
cites work: Reactive GRASP for the strip-packing problem
cites work: The geometry of nesting problems: a tutorial
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
cites work: Solving circle packing problems by global optimization: numerical results and industrial applications
cites work: Robust mixed-integer linear programming models for the irregular strip packing problem
cites work: Q4886050
cites work: Mixed-integer programming models for nesting problems
cites work: Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
cites work: Reverse convex programming
cites work: A review of the application of meta-heuristic algorithms to 2D strip packing problems
cites work: A fully general, exact algorithm for nesting irregular shapes
cites work: Rotational polygon containment and minimum enclosure using only robust 2D constructions
cites work: GLOMIQO: global mixed-integer quadratic optimizer
cites work: TOPOS -- A new constructive algorithm for nesting problems
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: An improved typology of cutting and packing problems
Wikidata QID: Q130134946
DOI: 10.1007/S10898-018-0637-Y
description: scientific article; zbMATH DE number 6928833