Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146)
by Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain and Mikhail Moshkov
From $96.79 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $94.59 at 100+
Total $2,419.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order together often pair the copies with something more. We handle the extras so you don't have to.
Bookplates, tipped-in pages, belly bands or author signatures. Subject to publisher approval.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journalsBookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoExtensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146)
Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.
Details
- Publisher
- Springer International Publishing
- Authors
- Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov
- Format
- Hardcover
- Published
- May 31, 2018
- ISBN-13
- 9783319918389
- Pages
- 280
- Printing
- Printed on demand
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146) for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $96.79 | 12% off list |
| 50 – 99 | $95.69 | 13% off list |
| 100+ | $94.59 | 14% off list |
Popular for
A copy for every member, on one order.
A book for every attendee, delivered to your venue.
For clients, staff, members or volunteers.
Where can I buy 100 copies of Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining?
BookPal sells Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining in quantity. At 100 copies the price is $94.59 a copy, against a list price of $109.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146) cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $96.79 (12% off list); 50 to 99 copies, $95.69 (13% off list); 100+ copies, $94.59 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining (Intelligent Systems Reference Library #146)
Groups also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.