The linear ordering problem: exact and heuristic methods in combinatorial optimization
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Applied mathematical sciences
175 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XII, 171 S. Ill., graph. Darst. |
| ISBN: | 3642167284 9783642167287 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV037211851 | ||
| 003 | DE-604 | ||
| 005 | 20120504 | ||
| 007 | t | ||
| 008 | 110208s2011 gw ad|| |||| 00||| eng d | ||
| 015 | |a 10,N40 |2 dnb | ||
| 016 | 7 | |a 1007313870 |2 DE-101 | |
| 020 | |a 3642167284 |c Gb. : ca. EUR 85.55 (DE) (freier Pr.), ca. sfr 115.00 (freier Pr.) |9 3-642-16728-4 | ||
| 020 | |a 9783642167287 |c Gb. : ca. EUR 85.55 (DE) (freier Pr.), ca. sfr 115.00 (freier Pr.) |9 978-3-642-16728-7 | ||
| 024 | 3 | |a 9783642167287 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80020577 |
| 035 | |a (OCoLC)706965437 | ||
| 035 | |a (DE-599)DNB1007313870 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-20 |a DE-83 |a DE-11 |a DE-824 |a DE-188 |a DE-739 | ||
| 082 | 0 | |a 519.64 |2 22/ger | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a 90C57 |2 msc | ||
| 084 | |a 90C27 |2 msc | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a 90Cxx |2 msc | ||
| 100 | 1 | |a Martí, Rafael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The linear ordering problem |b exact and heuristic methods in combinatorial optimization |c Rafael Martí ; Gerhard Reinelt |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XII, 171 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Applied mathematical sciences |v 175 | |
| 650 | 0 | 7 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Lineares Ordnungsproblem |0 (DE-588)4120676-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
| 689 | 0 | 1 | |a Lineares Ordnungsproblem |0 (DE-588)4120676-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Reinelt, Gerhard |e Verfasser |0 (DE-588)101987113X |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-642-16729-4 |
| 830 | 0 | |a Applied mathematical sciences |v 175 |w (DE-604)BV000005274 |9 175 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3544046&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021125889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-021125889 | |
Datensatz im Suchindex
| _version_ | 1805095362503901184 |
|---|---|
| adam_text |
IMAGE 1
CONTENTS
1 INTRODUCTION 1
1.1 BASIC DEFINITIONS 1
1.2 APPLICATIONS OF THE LINEAR ORDERING PROBLEM 3
1.2.1 EQUIVALENT GRAPH PROBLEMS 3
1.2.2 RELATED GRAPH PROBLEMS 4
1.2.3 AGGREGATION OF INDIVIDUAL PREFERENCES 4
1.2.4 BINARY CHOICE PROBABILITIES 5
1.2.5 TRIANGULATION OF INPUT-OUTPUT TABLES 5
1.2.6 OPTIMAL WEIGHTED ANCESTRY RELATIONSHIPS 6
1.2.7 RANKING IN SPORTS TOURNAMENTS 6
1.2.8 CORRUPTION PERCEPTION 7
1.2.9 CROSSING MINIMIZATION 8
1.2.10 LINEAR ORDERING WITH QUADRATIC OBJECTIVE FUNCTION 8 1.2.11
SCHEDULING WITH PRECEDENCES 9
1.2.12 LINEAR ORDERING WITH CUMULATIVE COSTS 9
1.2.13 COUPLED TASK PROBLEM 9
1.2.14 TARGET VISITATION PROBLEM 10
1.3 BENCHMARK PROBLEMS 10
1.3.1 DATA FORMAT 10
1.3.2 INPUT-OUTPUT MATRICES 12
1.3.3 RANDOMLY GENERATED INSTANCES A (TYPE 1) 13
1.3.4 RANDOMLY GENERATED INSTANCES A (TYPE 2) 13
1.3.5 RANDOMLY GENERATED INSTANCES B 13
1.3.6 SGB INSTANCES 13
1.3.7 INSTANCES OF SCHIAVINOTTO AND STUETZTE 14
1.3.8 INSTANCES OF MITCHELL AND BORCHERS 14
1.3.9 FURTHER SPECIAL INSTANCES 14
2 HEURISTIC METHODS 17
2.1 INTRODUCTION 17
2.1.1 ASSESSING THE QUALITY OF HEURISTICS 19
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1007313870
DIGITALISIERT DURCH
IMAGE 2
CONTENTS
2.2 CONSTRUCTION HEURISTICS 21
2.2.1 THE METHOD OF CHENERY AND WATANABE 21
2.2.2 HEURISTICS OF AUJAC & MASSON 22
2.2.3 HEURISTICS OF BECKER 22
2.2.4 BEST INSERTION 23
2.3 LOCAL SEARCH 25
2.3.1 INSERTION 26
2.3.2 THE HEURISTIC OF CHANAS & KOBYLANSKI 27
2.3.3 FC-OPT 27
2.3.4 KERNIGHAN-LIN TYPE IMPROVEMENT 27
2.3.5 LOCAL ENUMERATION 29
2.4 MULTI-START PROCEDURES 30
2.4.1 VARIANTS OF MULTI-START 31
2.4.2 EXPERIMENTS WITH THE LOP 33
META-HEURISTICS 41
3.1 INTRODUCTION 41
3.2 GRASP 43
3.2.1 CONSTRUCTION PHASE 44
3.2.2 IMPROVEMENT PHASE 48
3.3 TABU SEARCH 50
3.3.1 SHORT TERM MEMORY 51
3.3.2 LONG TERM MEMORY 53
3.4 SIMULATED ANNEALING 56
3.5 VARIABLE NEIGHBORHOOD SEARCH 60
3.5.1 VARIABLE NEIGHBORHOOD DESCENT 61
3.5.2 RESTRICTED VARIABLE NEIGHBORHOOD SEARCH 61
3.5.3 BASIC VARIABLE NEIGHBORHOOD SEARCH 62
3.5.4 FREQUENCY VARIABLE NEIGHBORHOOD SEARCH 62
3.5.5 HYBRID VARIABLE NEIGHBORHOOD SEARCH 63
3.6 SCATTER SEARCH 66
3.6.1 REFERENCE SET CREATION 70
3.6.2 REFERENCE SET UPDATE 71
3.6.3 REFERENCE SET REBUILD 73
3.7 GENETIC ALGORITHMS 77
3.8 EMPIRICAL COMPARISON 82
BRANCH-AND-BOUND 85
4.1 INTRODUCTION 85
4.2 BRANCH-AND-BOUND WITH PARTIAL ORDERINGS 87
4.3 LEXICOGRAPHIC SEARCH 89
4.4 EXTENSION OF LEXICOGRAPHIC SEARCH TO BRANCH-AND-BOUND 89 4.5
BRANCH-AND-BOUND WITH LAGRANGIAN RELAXATION 91
IMAGE 3
CONTENTS XI
5 BRANCH-AND-CUT 95
5.1 INTEGER PROGRAMMING 95
5.2 CUTTING PLANE ALGORITHMS 97
5.3 BRANCH-AND-CUT WITH 3-DICYCLE CUTS 100
5.3.1 SOLVING THE 3-DIYCLE RELAXATION 101
5.3.2 AN LP BASED HEURISTIC 102
5.3.3 COMPUTATIONAL RESULTS WITH 3-DICYCLES 102
5.4 GENERATION OF FURTHER CUTS 104
5.4.1 CHVATAL-GOMORY CUTS 104
5.4.2 MAXIMALLY VIOLATED MOD-A: CUTS 105
5.4.3 MOD-2 CUTS 107
5.5 IMPLEMENTATION OF BRANCH-AND-CUT 107
5.5.1 INITIALIZATION 108
5.5.2 ACTIVE VARIABLES 109
5.5.3 LOCAL UPPER BOUND 109
5.5.4 BRANCHING 109
5.5.5 FIXING AND SETTING OF VARIABLES 109
5.5.6 LOGICAL IMPLICATIONS 110
5.5.7 SELECTION OF NODES 110
5.5.8 LOWER BOUNDS I LL
5.5.9 SEPARATION I LL
5.5.10 ELIMINATION OF CONSTRAINTS I LL
5.5.11 CONSTRAINT POOL I LL
5.5.12 PRICING I LL
5.5.13 INFEASIBLE LPS 112
5.5.14 ADDITION OF VARIABLES 112
5.6 SOME COMPUTATIONAL RESULTS 113
6 THE LINEAR ORDERING POLYTOPE 117
6.1 POLYHEDRAL COMBINATORICS AND BASIC RESULTS 117
6.2 FACETS OF THE LINEAR ORDERING POLYTOPE 120
6.3 COMPUTATION OF COMPLETE DESCRIPTIONS 126
6.4 DIFFERENCES BETWEEN FACETS 130
6.5 SEPARATION OF SMALL FACETS 135
6.6 COMPUTATIONAL EXPERIMENTS WITH SMALL FACETS 139
6.6.1 COMPARISON OF HEURISTICS 139
6.6.2 CUTTING PLANE SELECTION 139
6.6.3 NUMBER OF CLASSES TAKEN INTO ACCOUNT 140
6.6.4 FACET SELECTION 141
6.7 LOCAL CUTS AND TARGET CUTS 141
7 FURTHER ASPECTS 145
7.1 APPROXIMATIVE ALGORITHMS 145
7.2 INTEGRALITY GAPS OF LP RELAXATIONS 146
7.3 DEGREE OF LINEARITY 146
7.4 SEMIDEFINITE RELAXATIONS 150
IMAGE 4
XII CONTENTS
7.5 CONTEXT INDEPENDENT SOLVERS 151
7.6 DIFFICULTY OF LOP INSTANCES 153
7.7 SPARSE PROBLEMS 155
7.8 A SIMPLE DUAL HEURISTIC 156
7.9 FUTURE RESEARCH 158
REFERENCES 163
INDEX 169 |
| any_adam_object | 1 |
| author | Martí, Rafael Reinelt, Gerhard |
| author_GND | (DE-588)101987113X |
| author_facet | Martí, Rafael Reinelt, Gerhard |
| author_role | aut aut |
| author_sort | Martí, Rafael |
| author_variant | r m rm g r gr |
| building | Verbundindex |
| bvnumber | BV037211851 |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)706965437 (DE-599)DNB1007313870 |
| dewey-full | 519.64 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.64 |
| dewey-search | 519.64 |
| dewey-sort | 3519.64 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV037211851</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120504</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110208s2011 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">10,N40</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1007313870</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642167284</subfield><subfield code="c">Gb. : ca. EUR 85.55 (DE) (freier Pr.), ca. sfr 115.00 (freier Pr.)</subfield><subfield code="9">3-642-16728-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642167287</subfield><subfield code="c">Gb. : ca. EUR 85.55 (DE) (freier Pr.), ca. sfr 115.00 (freier Pr.)</subfield><subfield code="9">978-3-642-16728-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642167287</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80020577</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)706965437</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1007313870</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C57</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90C27</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Martí, Rafael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The linear ordering problem</subfield><subfield code="b">exact and heuristic methods in combinatorial optimization</subfield><subfield code="c">Rafael Martí ; Gerhard Reinelt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 171 S.</subfield><subfield code="b">Ill., graph. Darst.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Applied mathematical sciences</subfield><subfield code="v">175</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">Lineares Ordnungsproblem</subfield><subfield code="0">(DE-588)4120676-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorische Optimierung</subfield><subfield code="0">(DE-588)4031826-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Lineares Ordnungsproblem</subfield><subfield code="0">(DE-588)4120676-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reinelt, Gerhard</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)101987113X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-642-16729-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Applied mathematical sciences</subfield><subfield code="v">175</subfield><subfield code="w">(DE-604)BV000005274</subfield><subfield code="9">175</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3544046&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021125889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-021125889</subfield></datafield></record></collection> |
| id | DE-604.BV037211851 |
| illustrated | Illustrated |
| indexdate | 2024-07-20T10:58:05Z |
| institution | BVB |
| isbn | 3642167284 9783642167287 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-021125889 |
| oclc_num | 706965437 |
| open_access_boolean | |
| owner | DE-20 DE-83 DE-11 DE-824 DE-188 DE-739 |
| owner_facet | DE-20 DE-83 DE-11 DE-824 DE-188 DE-739 |
| physical | XII, 171 S. Ill., graph. Darst. |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Applied mathematical sciences |
| series2 | Applied mathematical sciences |
| spelling | Martí, Rafael Verfasser aut The linear ordering problem exact and heuristic methods in combinatorial optimization Rafael Martí ; Gerhard Reinelt Berlin [u.a.] Springer 2011 XII, 171 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Applied mathematical sciences 175 Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Lineares Ordnungsproblem (DE-588)4120676-9 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s Lineares Ordnungsproblem (DE-588)4120676-9 s DE-604 Reinelt, Gerhard Verfasser (DE-588)101987113X aut Erscheint auch als Online-Ausgabe 978-3-642-16729-4 Applied mathematical sciences 175 (DE-604)BV000005274 175 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3544046&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021125889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Martí, Rafael Reinelt, Gerhard The linear ordering problem exact and heuristic methods in combinatorial optimization Applied mathematical sciences Kombinatorische Optimierung (DE-588)4031826-6 gnd Lineares Ordnungsproblem (DE-588)4120676-9 gnd |
| subject_GND | (DE-588)4031826-6 (DE-588)4120676-9 |
| title | The linear ordering problem exact and heuristic methods in combinatorial optimization |
| title_auth | The linear ordering problem exact and heuristic methods in combinatorial optimization |
| title_exact_search | The linear ordering problem exact and heuristic methods in combinatorial optimization |
| title_full | The linear ordering problem exact and heuristic methods in combinatorial optimization Rafael Martí ; Gerhard Reinelt |
| title_fullStr | The linear ordering problem exact and heuristic methods in combinatorial optimization Rafael Martí ; Gerhard Reinelt |
| title_full_unstemmed | The linear ordering problem exact and heuristic methods in combinatorial optimization Rafael Martí ; Gerhard Reinelt |
| title_short | The linear ordering problem |
| title_sort | the linear ordering problem exact and heuristic methods in combinatorial optimization |
| title_sub | exact and heuristic methods in combinatorial optimization |
| topic | Kombinatorische Optimierung (DE-588)4031826-6 gnd Lineares Ordnungsproblem (DE-588)4120676-9 gnd |
| topic_facet | Kombinatorische Optimierung Lineares Ordnungsproblem |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3544046&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=021125889&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000005274 |
| work_keys_str_mv | AT martirafael thelinearorderingproblemexactandheuristicmethodsincombinatorialoptimization AT reineltgerhard thelinearorderingproblemexactandheuristicmethodsincombinatorialoptimization |