Cover Image

Combinatorial Heuristic Algorithms with FORTRAN

by H. T. Lau
I. Integer Programming -- 1. Integer Linear Programming -- 2. Zero-one Linear Programming -- 3. Zero-one Knapsack Problem -- II. Network Design -- 4. Traveling Salesman Problem -- 5. Steiner Tree Problem -- 6. Graph Partitioning -- 7. K-Median Location -- 8. K-Center Location -- List of Subroutines -- Bibliographic Notes.
Year of publication:
1986
Publisher: Berlin : Springer
Subject: Heuristik | Heuristics | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory
Online Resource
Check full text access |
Check Google Scholar
In libraries world-wide (WorldCat)
In German libraries (KVK)
subito order
I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10013519049
Similar items by subject