Approximate packing: integer programming models, valid inequalities and nesting
type: Item
instance of: scholarly article
title: Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
zbMATH Open document ID: 1390.90470
DOI: 10.1007/978-3-319-18899-7_9
author: L. Ozuna
author: I. Litvinchev
author: Luis Infante
published in: Optimized Packings with Applications
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6859419
zbMATH Keywords: packing problems
zbMATH Keywords: integer programming
zbMATH Keywords: large-scale optimization
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-18899-7 9
OpenAlex ID: W2280720710
cites work: The distributor's three-dimensional pallet-packing problem: a human intelligence-based heuristic approach
cites work: Solving circle packing problems by global optimization: numerical results and industrial applications
cites work: Solving Non-standard Packing Problems by Global Optimization and Heuristics
cites work: Integrated container loading software for pulp and paper industry
cites work: Packing of unequal spheres and automated radiosurgical treatment planning
cites work: A literature review on circle and sphere packing problems: models and methodologies
cites work: A heuristic for the circle packing problem with a variety of containers
cites work: Packing unequal circles using formulation space search
cites work: Solving the circular open dimension problem by using separate beams and look-ahead strategies
cites work: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
cites work: Packing congruent spheres into a multi‐connected polyhedral domain
cites work: A tutorial in irregular shape packing problems
cites work: Linear models for the approximate solution of the problem of packing equal circles into a given domain
cites work: Integer programming formulations for approximate packing circles in a rectangular container
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Assignment Problems
cites work: Constraints in container loading -- a state-of-the-art review
cites work: Multiple Container Packing: A Case Study of Pipe Packing
cites work: A complete search method for the relaxed traveling tournament problem
cites work: Packing circular-like objects in a rectangular container
cites work: Aggregation in large-scale optimization
cites work: Irregular packing using the line and arc no-fit polygon
Recommended article: Packing circular-like objects in a rectangular container
Recommended article: Integer programming formulations for approximate packing circles in a rectangular container
Recommended article: Mixed-integer programming models for nesting problems
Recommended article: Irregular packing: MILP model based on a polygonal enclosure
Recommended article: A cutting plane method and a parallel algorithm for packing rectangles in a circular container
description: scientific article; zbMATH DE number 6859419