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.

MoreLess

Year of publication:	1986
Publisher:	Berlin : Springer
Subject:	Heuristik \| Heuristics \| Algorithmus \| Algorithm \| Scheduling-Verfahren \| Scheduling problem \| Theorie \| Theory

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Extent:	Online-Ressource (VII, 137p) digital
Series:	Lecture Notes in Economics and Mathematical Systems ; 280
Type of publication:	Book / Working Paper
Language:	English
ISBN:	978-3-642-61649-5 ; 978-3-540-17161-4
Other identifiers:	10.1007/978-3-642-61649-5 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10013519049