MIP-based heuristic for non-standard 3D-packing problems
type: Item
instance of: scholarly article
title: MIP-based heuristic for non-standard 3D-packing problems
zbMATH Open document ID: 1175.90428
author: Giorgio Fasano
published in: 4OR
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5577668
describes a project that uses: TOPOS
describes a project that uses: MathOptimizer
MaRDI profile type: Publication
full work available at URL: s10288-007-0049-1
OpenAlex ID: W2041809965
Wikidata QID: Q126211791
cites work: Using a tabu search approach for solving the two-dimensional irregular cutting problem
cites work: An analytical model for the container loading problem
cites work: Q4398379
cites work: Fast neighborhood search for two- and three-dimensional nesting problems
cites work: Q4452991
cites work: A MIP approach for some practical packing problems: balancing constraints and tetris-like items
cites work: Q4452988
cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
cites work: A 2-exchange heuristic for nesting problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems
cites work: An integer-programming-based heuristic for the balanced loading problem
cites work: The two-dimensional bin packing problem with variable bin sizes and costs
cites work: \(\Phi\)-functions for complex 2D-objects
cites work: Q4452990
DOI: 10.1007/S10288-007-0049-1
description: scientific article; zbMATH DE number 5577668