Combinatorial Heuristic Algorithms with FORTRAN:
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 re...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1986
|
| Ausgabe: | 1st ed. 1986 |
| Schriftenreihe: | Lecture Notes in Economics and Mathematical Systems
280 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | 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 |
| Beschreibung: | 1 Online-Ressource (X, 129 p) |
| ISBN: | 9783642616495 |
| DOI: | 10.1007/978-3-642-61649-5 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV046871926 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1986 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642616495 |9 978-3-642-61649-5 | ||
| 024 | 7 | |a 10.1007/978-3-642-61649-5 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-3-642-61649-5 | ||
| 035 | |a (OCoLC)863752981 | ||
| 035 | |a (DE-599)BVBBV046871926 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.40301 |2 23 | |
| 084 | |a QH 422 |0 (DE-625)141576: |2 rvk | ||
| 084 | |a SI 853 |0 (DE-625)143200: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 100 | 1 | |a Lau, Hang Tong |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Combinatorial Heuristic Algorithms with FORTRAN |c by Hang Tong Lau |
| 250 | |a 1st ed. 1986 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 1986 | |
| 300 | |a 1 Online-Ressource (X, 129 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Lecture Notes in Economics and Mathematical Systems |v 280 | |
| 520 | |a 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 | ||
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 0 | 7 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programm |0 (DE-588)4047394-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a FORTRAN 77 |0 (DE-588)4113601-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Heuristik |0 (DE-588)4024772-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a FORTRAN |0 (DE-588)4017984-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a FORTRAN-Programm |0 (DE-588)4155080-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a FORTRAN |0 (DE-588)4017984-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 3 | |a Programm |0 (DE-588)4047394-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a FORTRAN |0 (DE-588)4017984-9 |D s |
| 689 | 1 | 1 | |a Heuristik |0 (DE-588)4024772-7 |D s |
| 689 | 1 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | 1 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 2 | 2 | |a FORTRAN 77 |0 (DE-588)4113601-9 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Netzwerkanalyse |0 (DE-588)4075298-7 |D s |
| 689 | 3 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 3 | 2 | |a FORTRAN-Programm |0 (DE-588)4155080-8 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a FORTRAN |0 (DE-588)4017984-9 |D s |
| 689 | 4 | 1 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 4 | |5 DE-604 | |
| 689 | 5 | 0 | |a Ganzzahlige Optimierung |0 (DE-588)4155950-2 |D s |
| 689 | 5 | 1 | |a FORTRAN-Programm |0 (DE-588)4155080-8 |D s |
| 689 | 5 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540171614 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642616501 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-61649-5 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032282058 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-61649-5 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181720315985920 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Lau, Hang Tong |
| author_facet | Lau, Hang Tong |
| author_role | aut |
| author_sort | Lau, Hang Tong |
| author_variant | h t l ht htl |
| building | Verbundindex |
| bvnumber | BV046871926 |
| classification_rvk | QH 422 SI 853 ST 250 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-3-642-61649-5 (OCoLC)863752981 (DE-599)BVBBV046871926 |
| dewey-full | 658.40301 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.40301 |
| dewey-search | 658.40301 |
| dewey-sort | 3658.40301 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Informatik Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Informatik Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-3-642-61649-5 |
| edition | 1st ed. 1986 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04955nmm a2200877zcb4500</leader><controlfield tag="001">BV046871926</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1986 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642616495</subfield><subfield code="9">978-3-642-61649-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-61649-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-3-642-61649-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863752981</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046871926</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.40301</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 422</subfield><subfield code="0">(DE-625)141576:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 853</subfield><subfield code="0">(DE-625)143200:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lau, Hang Tong</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial Heuristic Algorithms with FORTRAN</subfield><subfield code="c">by Hang Tong Lau</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1986</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 129 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Lecture Notes in Economics and Mathematical Systems</subfield><subfield code="v">280</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN 77</subfield><subfield code="0">(DE-588)4113601-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Heuristik</subfield><subfield code="0">(DE-588)4024772-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN-Programm</subfield><subfield code="0">(DE-588)4155080-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Heuristik</subfield><subfield code="0">(DE-588)4024772-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">FORTRAN 77</subfield><subfield code="0">(DE-588)4113601-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Netzwerkanalyse</subfield><subfield code="0">(DE-588)4075298-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">FORTRAN-Programm</subfield><subfield code="0">(DE-588)4155080-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Ganzzahlige Optimierung</subfield><subfield code="0">(DE-588)4155950-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">FORTRAN-Programm</subfield><subfield code="0">(DE-588)4155080-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540171614</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642616501</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-61649-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032282058</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-61649-5</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046871926 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:36Z |
| indexdate | 2024-07-10T08:56:08Z |
| institution | BVB |
| isbn | 9783642616495 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032282058 |
| oclc_num | 863752981 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (X, 129 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Lecture Notes in Economics and Mathematical Systems |
| spelling | Lau, Hang Tong Verfasser aut Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau 1st ed. 1986 Berlin, Heidelberg Springer Berlin Heidelberg 1986 1 Online-Ressource (X, 129 p) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Economics and Mathematical Systems 280 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 Operations Research/Decision Theory Operations research Decision making Netzwerkanalyse (DE-588)4075298-7 gnd rswk-swf Programm (DE-588)4047394-6 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf FORTRAN 77 (DE-588)4113601-9 gnd rswk-swf Heuristik (DE-588)4024772-7 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf FORTRAN (DE-588)4017984-9 gnd rswk-swf Ganzzahlige Optimierung (DE-588)4155950-2 gnd rswk-swf FORTRAN-Programm (DE-588)4155080-8 gnd rswk-swf FORTRAN (DE-588)4017984-9 s Algorithmus (DE-588)4001183-5 s Kombinatorik (DE-588)4031824-2 s Programm (DE-588)4047394-6 s DE-604 Heuristik (DE-588)4024772-7 s FORTRAN 77 (DE-588)4113601-9 s Netzwerkanalyse (DE-588)4075298-7 s Optimierung (DE-588)4043664-0 s FORTRAN-Programm (DE-588)4155080-8 s Kombinatorische Optimierung (DE-588)4031826-6 s Ganzzahlige Optimierung (DE-588)4155950-2 s Erscheint auch als Druck-Ausgabe 9783540171614 Erscheint auch als Druck-Ausgabe 9783642616501 https://doi.org/10.1007/978-3-642-61649-5 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Lau, Hang Tong Combinatorial Heuristic Algorithms with FORTRAN Operations Research/Decision Theory Operations research Decision making Netzwerkanalyse (DE-588)4075298-7 gnd Programm (DE-588)4047394-6 gnd Optimierung (DE-588)4043664-0 gnd FORTRAN 77 (DE-588)4113601-9 gnd Heuristik (DE-588)4024772-7 gnd Kombinatorik (DE-588)4031824-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd FORTRAN (DE-588)4017984-9 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd FORTRAN-Programm (DE-588)4155080-8 gnd |
| subject_GND | (DE-588)4075298-7 (DE-588)4047394-6 (DE-588)4043664-0 (DE-588)4113601-9 (DE-588)4024772-7 (DE-588)4031824-2 (DE-588)4031826-6 (DE-588)4001183-5 (DE-588)4017984-9 (DE-588)4155950-2 (DE-588)4155080-8 |
| title | Combinatorial Heuristic Algorithms with FORTRAN |
| title_auth | Combinatorial Heuristic Algorithms with FORTRAN |
| title_exact_search | Combinatorial Heuristic Algorithms with FORTRAN |
| title_exact_search_txtP | Combinatorial Heuristic Algorithms with FORTRAN |
| title_full | Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau |
| title_fullStr | Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau |
| title_full_unstemmed | Combinatorial Heuristic Algorithms with FORTRAN by Hang Tong Lau |
| title_short | Combinatorial Heuristic Algorithms with FORTRAN |
| title_sort | combinatorial heuristic algorithms with fortran |
| topic | Operations Research/Decision Theory Operations research Decision making Netzwerkanalyse (DE-588)4075298-7 gnd Programm (DE-588)4047394-6 gnd Optimierung (DE-588)4043664-0 gnd FORTRAN 77 (DE-588)4113601-9 gnd Heuristik (DE-588)4024772-7 gnd Kombinatorik (DE-588)4031824-2 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Algorithmus (DE-588)4001183-5 gnd FORTRAN (DE-588)4017984-9 gnd Ganzzahlige Optimierung (DE-588)4155950-2 gnd FORTRAN-Programm (DE-588)4155080-8 gnd |
| topic_facet | Operations Research/Decision Theory Operations research Decision making Netzwerkanalyse Programm Optimierung FORTRAN 77 Heuristik Kombinatorik Kombinatorische Optimierung Algorithmus FORTRAN Ganzzahlige Optimierung FORTRAN-Programm |
| url | https://doi.org/10.1007/978-3-642-61649-5 |
| work_keys_str_mv | AT lauhangtong combinatorialheuristicalgorithmswithfortran |