My first novel, Love Me Back, was published on September 16. Writing the book took seven years, and along the way three chapters were published in...
Continue »
This book contains combinatorial heuristic algorithms with computer programs in FORTRAN 77. Each of the following regarded problems has been shown to be NP-complete: integer linear programming, zero-one linear programming, zero-one knapsack problem, traveling salesman problem, Steiner tree problem, graph partitioning, k-center location. After a short description of each problem and the presented heuristic algorithm to solve it, the parameter description of the subroutines and the main program is given. The corresponding algorithms are printed directly by the computer. A small example with input and output data illustrates the usage of each computer program.
There are many well-written textbooks that cover the theory
and algorithms on graphs and combinatorial optimization.
Very few provide the computer code for the methods. This
book offers an extensive collection of Java programs in
this area. Each program is self-contained and can be used
independently through parameter passing. The drawback of
the book is that the coding style is not object oriented,
and the programs would be difficult to maintain. The
description of the methods and their implementations is
terse. Hence the book is not intended as a learning text.
But the library of programs is a very convenient handy
device for students and researchers in locating solutions
to classroom didactic problems in graphs and optimization,
which apparently is the main objective of the book.
This extensive library of computer programs-written in C language-allows readers to solve numerical problems in areas of linear algebra, ordinary and partial differential equations, optimization, parameter estimation, and special functions of mathematical physics. The important characteristic of the library is its modular structure. Because it is highly compact, it is well-suited for use on personal computers. The library offers the expert a prodigious collection of procedures for implementing numerical methods. The novice can experiment with the worked examples provided and use the more comprehensive procedures to perform mathematical computations. The library provides a powerful research tool for computer scientists, engineers, and applied mathematicians.
Was this comment helpful? | Yes | No
(1 of 1 readers found this comment helpful)
This book contains combinatorial heuristic algorithms with computer programs in FORTRAN 77. Each of the following regarded problems has been shown to be NP-complete: integer linear programming, zero-one linear programming, zero-one knapsack problem, traveling salesman problem, Steiner tree problem, graph partitioning, k-center location. After a short description of each problem and the presented heuristic algorithm to solve it, the parameter description of the subroutines and the main program is given. The corresponding algorithms are printed directly by the computer. A small example with input and output data illustrates the usage of each computer program.
This extensive library of computer programs-written in C language-allows readers to solve numerical problems in areas of linear algebra, ordinary and partial differential equations, optimization, parameter estimation, and special functions of mathematical physics. The important characteristic of the library is its modular structure. Because it is highly compact, it is well-suited for use on personal computers. The library offers the expert a prodigious collection of procedures for implementing numerical methods. The novice can experiment with the worked examples provided and use the more comprehensive procedures to perform mathematical computations. The library provides a powerful research tool for computer scientists, engineers, and applied mathematicians.
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.
Customer Comments
Practitioner has commented on (7) products.
Lecture Notes in Economics and Mathematical Systems #280: Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau
Practitioner, December 6, 2011
This book contains combinatorial heuristic algorithms with computer programs in FORTRAN 77. Each of the following regarded problems has been shown to be NP-complete: integer linear programming, zero-one linear programming, zero-one knapsack problem, traveling salesman problem, Steiner tree problem, graph partitioning, k-center location. After a short description of each problem and the presented heuristic algorithm to solve it, the parameter description of the subroutines and the main program is given. The corresponding algorithms are printed directly by the computer. A small example with input and output data illustrates the usage of each computer program.A Java Library of Graph Algorithms and Optimization by Hang Tong Lau
Practitioner, December 6, 2011
There are many well-written textbooks that cover the theoryand algorithms on graphs and combinatorial optimization.
Very few provide the computer code for the methods. This
book offers an extensive collection of Java programs in
this area. Each program is self-contained and can be used
independently through parameter passing. The drawback of
the book is that the coding style is not object oriented,
and the programs would be difficult to maintain. The
description of the methods and their implementations is
terse. Hence the book is not intended as a learning text.
But the library of programs is a very convenient handy
device for students and researchers in locating solutions
to classroom didactic problems in graphs and optimization,
which apparently is the main objective of the book.
A Numerical Library in C for Scientists and Engineers by Hang Tong Lau
Practitioner, December 6, 2011
This extensive library of computer programs-written in C language-allows readers to solve numerical problems in areas of linear algebra, ordinary and partial differential equations, optimization, parameter estimation, and special functions of mathematical physics. The important characteristic of the library is its modular structure. Because it is highly compact, it is well-suited for use on personal computers. The library offers the expert a prodigious collection of procedures for implementing numerical methods. The novice can experiment with the worked examples provided and use the more comprehensive procedures to perform mathematical computations. The library provides a powerful research tool for computer scientists, engineers, and applied mathematicians.(1 of 1 readers found this comment helpful)
Combinatorial Heuristic Algorithms with Fortran by Hang Tong Lau
Practitioner, December 6, 2011
This book contains combinatorial heuristic algorithms with computer programs in FORTRAN 77. Each of the following regarded problems has been shown to be NP-complete: integer linear programming, zero-one linear programming, zero-one knapsack problem, traveling salesman problem, Steiner tree problem, graph partitioning, k-center location. After a short description of each problem and the presented heuristic algorithm to solve it, the parameter description of the subroutines and the main program is given. The corresponding algorithms are printed directly by the computer. A small example with input and output data illustrates the usage of each computer program.A Numerical Library in C for Scientists and Engineers
Practitioner, December 6, 2011
This extensive library of computer programs-written in C language-allows readers to solve numerical problems in areas of linear algebra, ordinary and partial differential equations, optimization, parameter estimation, and special functions of mathematical physics. The important characteristic of the library is its modular structure. Because it is highly compact, it is well-suited for use on personal computers. The library offers the expert a prodigious collection of procedures for implementing numerical methods. The novice can experiment with the worked examples provided and use the more comprehensive procedures to perform mathematical computations. The library provides a powerful research tool for computer scientists, engineers, and applied mathematicians.1-5 of 7next