Skip to main content
SpringerLink
Log in

Combinatorial Heuristic Algorithms with FORTRAN

  • Book
  • © 1986

Overview

Authors:
  1. H. T. Lau

    1. Bell-Northern Research, Verdun, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 280)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages i-ix
    Download chapter PDF

  2. Integer Programming

    1. Integer Linear Programming

      • H. T. Lau
      Pages 1-29

    2. Zero-One Linear Programming

      • H. T. Lau
      Pages 30-37

    3. Zero-One Knapsack Problem

      • H. T. Lau
      Pages 38-51

  3. Network Design

    1. Traveling Salesman Problem

      • H. T. Lau
      Pages 52-80

    2. Steiner Tree Problem

      • H. T. Lau
      Pages 81-97

    3. Graph Partitioning

      • H. T. Lau
      Pages 98-105

    4. K-Median Location

      • H. T. Lau
      Pages 106-113

    5. K-Center Location

      • H. T. Lau
      Pages 114-122

  4. Back Matter

    Pages 123-128
    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Bell-Northern Research, Verdun, Canada

    H. T. Lau

Bibliographic Information

  • Book Title: Combinatorial Heuristic Algorithms with FORTRAN

  • Authors: H. T. Lau

  • Series Title: Lecture Notes in Economics and Mathematical Systems

  • DOI: https://doi.org/10.1007/978-3-642-61649-5

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1986

  • Softcover ISBN: 978-3-540-17161-4Published: 01 November 1986

  • eBook ISBN: 978-3-642-61649-5Published: 06 December 2012

  • Series ISSN: 0075-8442

  • Series E-ISSN: 2196-9957

  • Edition Number: 1

  • Number of Pages: X, 129

  • Topics: Operations Research/Decision Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation