Combinatorial Heuristic Algorithms with FORTRAN

Name: Combinatorial Heuristic Algorithms with FORTRAN
Brand: Springer Nature
SKU: 9783540171614
Availability: InStock

Best Price (Coupon Required):
Buy Combinatorial Heuristic Algorithms with FORTRAN for $36.00 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $39.99 - $39.99

BEST PRICE

Single Product Purchase

$36.00

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$39.99	$39.99		10% OFF This deals requires coupon	$36.00		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783540171614

Condition

New

Product Description

In recent years researchers have spent much effort in developing efficient heuristic algorithms for solving the class of NP-complete problems which are widely believed to be inherently intractable from the computational point of view. Although algorithms have been designed and are notorious among researchers, computer programs are either not implemented on computers or very difficult to obtain. The purpose of this book is to provide a source of FORTRAN coded algorithms for a selected number of well-known combinatorial optimization problems. The book is intended to be used as a supplementary text in combinatorial algorithms, network optimization, operations research and management science. In addition, a short description on each algorithm will allow the book to be used as a convenient reference. This work would not have been possible without the excellent facilities of Bell-Northern Research, Canada. H. T. Lau lIe des Soeurs Quebec, Canada August 1986 CONTENTS Page Introduction Part I. INTEGER PROGRAMMING Chapter 1. Integer Linear Programming Chapter 2. Zero-one Linear Programming 30 Chapter 3. Zero-one Knapsack Problem 38 Part II. NETWORK DESIGN Chapter 4. Traveling Salesman Problem 52 Chapter 5. Steiner Tree Problem 81 Chapter 6. Graph Partitioning 98 Chapter 7. K-Median Location 106 Chapter 8. K-Center Location 114 List of Subroutines 123 Bibliographic Notes 124 INTRODUCTION Following the elegant theory of NP-comp1eteness, the idea of developing efficient heuristic algorithms has been gaining its popularity and significance.

Available Colors

N/A

Available Sizes

N/A

Reviews

0 reviews

5 stars

4 stars

3 stars

2 stars

1 star

Questions & Answers

Similar Products

Mathematische Methoden der Wirtschaftswissenschaften

$59.99

Abortion and the Law

$159.99

The Purpose of Business

$84.99

Die Personalfunktion der Unternehmung im Spannungsfeld von Humanitt und wirtschaftlicher Rationalit

$54.99

Asset Allocation and International Investments

$169.00

Proceedings of the 5th International Conference on Numerical Modelling in Engineering

$189.00

Umweltkonomik, Umweltpolitik und Marktwirtschaft

$44.99

Macho Men in South African Gyms

$109.99

Shakespeares Political Wisdom

$54.99

Molecular and Quantum Pharmacology

$219.99

Minorities and Boundaries

$39.99

The Political Economy of Eastern Europe 30 years into the Transition

$129.99

James Joyce and the Russians

$84.99

Research on the Characteristics and Effects of Climate Extremes on Multi-spatial-temporal Scales in

$84.99

The New York Times Monday Through Friday Easy to Tough Crossword Puzzles Volume 8- 50 Puzzles from the Pages of the New York Times by The New York Tim

$13.99