Carrito de compras


Optimized Packings with Applications

por Springer International Publishing
Condición: Nuevo
98,78 €
IVA incluído - Envío GRATIS
Springer International Publishing Optimized Packings with Applications
Springer International Publishing - Optimized Packings with Applications

¿Le gusta este producto? ¡Compártalo con todo el mundo!

98,78 € incl. IVA
Solo 1 artículos disponibles Solo 1 artículos disponibles
Entrega: entre miércoles, 25 de mayo de 2022 y viernes, 27 de mayo de 2022
Ventas y envío: Dodax

Descripción

This volume presents a selection of case studies that address a substantial range of optimized object packings (OOP) and their applications. The contributing authors are well-recognized researchers and practitioners. The mathematical modelling and numerical solution aspects of each application case study are presented in sufficient detail. A broad range of OOP problems are discussed: these include various specific and non-standard container loading and object packing problems, as well as the stowing of hazardous and other materials on container ships, data centre resource management, automotive engineering design, space station logistic support, cutting and packing problems with placement constraints, the optimal design of LED street lighting, robust sensor deployment strategies, spatial scheduling problems, and graph coloring models and metaheuristics for packing applications. Novel points of view related to model development and to computational nonlinear, global, mixed integer optimization and heuristic strategies are also discussed.


Optimized Packings with Applications will benefit researchers and practitioners working on a broad range of topical engineering and operations research applications. Academics, graduate and post-graduate students in the fields of engineering, applied mathematics, operations research and optimization will also find the book useful, since it discusses a range of advanced model development and solution techniques and tools in the context of real-world applications and new challenges.

Detalles de producto

Ilustraciones:
XVII, 326 p. 95 illus., 67 illus. in color.
Indice:

Using a Bin Packing Approach for Stowing Hazardous Containers into Containerships.- Dynamic Packing with Side Constraints for Datacenter Resource Management.- Packing Optimization of Free-Form Objects in Engineering Design.- A Modeling-Based Approach for Non-Standard Packing Problems.- CAST: A Successful Project in Support of the International Space Station Logistics.- Cutting and Packing Problems with Placement Constraints.- A Container Loading Problem MILP-based Heuristics Solved by CPLEX:An Experimental Analysis.- Automatic Design of Optimal LED Street Lights.- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting.- Exploiting Packing Components in General-Purpose Integer Programming Solvers.- Robust Designs for Circle Coverings of a Square.- Batching-based Approaches for Optimized Packing of Jobs in the Spatial Scheduling Problem.- Optimized Object Packings Using Quasi-Phi-Functions.- Graph Coloring Models and Metaheuristics for Packing Applications.

Editor:
Fasano, Giorgio;Fasano
Pintér, János D.;Pintér
Observaciones:
Contains an in-depth discussion of advanced model development strategies for optimized packings


Presents state-of-the-art methodology for handling optimized object packing problems


Illustrates key mathematical modeling and numerical solutions of algorithmic strategies and application case studies?


Includes supplementary material: sn.pub/extras

Tipo de medio:
Tapa blanda
Editorial:
Springer International Publishing
Idioma:
Inglés
Edición:
Softcover reprint of the original 1st ed. 2015
Número de páginas:
326

Datos base

Tipo de producto:
Libro de bolsillo
Fecha de aparición:
29 de octubre de 2016
Dimensiones del paquete:
0.235 x 0.155 x 0.021 m;
GTIN:
09783319371900
DUIN:
M1A1OQKU014
98,78 €
Utilizamos cookies en nuestro sitio web para que nuestros servicios sean más eficientes y más fáciles de usar. Por lo tanto, seleccione "Aceptar cookies". Lea nuestra Política de privacidad para obtener más información.