Cutting and Packing Problems: From the Perspective of Combinatorial Optimization - Image 1

£99.99

Springer Cutting and Packing Problems: From the Perspective of Combinatorial Optimization

Name: Cutting and Packing Problems: From the Perspective of Combinatorial Optimization
Brand: Springer
Price: 99.99 GBP
Availability: InStock

Balanced Scorecard

It has never been this cheap. We have no record of a lower price.

£100 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 74 days • 74 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 74 days • 1 price levels

Days at Price

Price Analysis

Most common price: £100 (74 days, 100.0%)

Price range: £100 - £100

Price levels: 1 different prices over 74 days

Description

This book provides a comprehensive overview of practical cutting and packing problems, presenting practical algorithms for solving these problems from the perspective of combinatorial optimization. It also discusses the geometric properties and tools for cutting and packing problems. Problems of cutting and packing objects have been extensively studied for many years because of the numerous real-world applications―for instance, in the clothing, logistics, manufacturing, and material industries. They can be classified in three ways according to their dimensions: The one-dimensional problem is the most basic category of problems including knapsack problems, bin packing problems, and cutting stock problems. The two-dimensional geometric problems include rectangle packing problems, circle packing problems, and polygon packing problems. The three-dimensional problem is the most difficult category and has applications in container loading, cargo and warehouse management and so forth. Most of these variants are NP-hard, since they contain as a special case the knapsack problem or the bin packing problem, which are already known to be NP-hard. Therefore, heuristics and metaheuristics are essential for designing practical algorithms for these problems. In addition to practical algorithms for solving a wide variety of cutting and packing problems, the book also considers another feature of cutting and packing problems: the need to develop powerful geometric tools to handle the wide variety and complexity of shapes that need to be packed.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 4431552901
Category: Books > Subjects > Business, Finance & Law > Management > Balanced Scorecard
Domain: Amazon UK
Release Date: 06 February 2017
Listed Since: 16 September 2014

Barcode

No barcode data available

Springer Cutting and Packing Problems: From the Perspective of Combinatorial Optimization

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Introduction to Cutting and Packing Optimization: Problems, Modeling Approaches, Solution Methods: 263 (International Series in Operations Research & Management Science, 263)

Optimized Packings with Applications: 105 (Springer Optimization and Its Applications, 105)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

Ant Colony Optimization and Applications: 947 (Studies in Computational Intelligence, 947)

Cutting and Packing in Production and Distribution: A Typology and Bibliography (Contributions to Management Science)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)

Springer Online Storage and Transportation Optimization Models

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Extremal Optimization: Fundamentals, Algorithms, and Applications

Local Search in Combinatorial Optimization

Springer Metaheuristics for Combinatorial Optimization 1332

The Disassembly Line: Balancing and Modeling (MECHANICAL ENGINEERING)

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization (Fields Institute Monographs)

Geometry of Cuts and Metrics: 15 (Algorithms and Combinatorics, 15)

Location, Scheduling, Design and Integer Programming: 3 (International Series in Operations Research & Management Science, 3)

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Springer Mathematical Theory of Optimization: 56 - Book