Reactive search and intelligent optimization:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New York, NY
Springer
2008
|
| Edition: | [1. ed.] |
| Series: | Operations research, computer science interfaces series
45 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | X, 196 S. Ill., graph. Darst. |
| ISBN: | 9780387096230 9780387096247 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035066842 | ||
| 003 | DE-604 | ||
| 005 | 20120109 | ||
| 007 | t | ||
| 008 | 080924s2008 gw ad|| |||| 00||| eng d | ||
| 015 | |a 08,N23,1285 |2 dnb | ||
| 016 | 7 | |a 988791412 |2 DE-101 | |
| 020 | |a 9780387096230 |c Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 127.00 (freier Pr.) |9 978-0-387-09623-0 | ||
| 020 | |a 9780387096247 |9 978-0-387-09624-7 | ||
| 035 | |a (OCoLC)231884196 | ||
| 035 | |a (DE-599)DNB988791412 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-703 |a DE-29T |a DE-11 | ||
| 050 | 0 | |a QA402.5 | |
| 082 | 0 | |a 519.64 |2 22 | |
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Battiti, Roberto |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Reactive search and intelligent optimization |c Roberto Battiti ; Mauro Brunato ; Franco Mascia |
| 250 | |a [1. ed.] | ||
| 264 | 1 | |a New York, NY |b Springer |c 2008 | |
| 300 | |a X, 196 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Operations research, computer science interfaces series |v 45 | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Heuristic programming | |
| 650 | 4 | |a Problem solving | |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |D s |
| 689 | 0 | 1 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Brunato, Mauro |e Verfasser |4 aut | |
| 700 | 1 | |a Mascia, Franco |e Verfasser |4 aut | |
| 830 | 0 | |a Operations research, computer science interfaces series |v 45 |w (DE-604)BV012124389 |9 45 | |
| 856 | 4 | 2 | |m GBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016735280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-016735280 | ||
Record in the Search Index
| _version_ | 1804138013432741888 |
|---|---|
| adam_text | ROBERTO BATTITI * MAURO BRUNATO * FRANCO MASCIA REACTIVE SEARCH AND
INTELLIGENT OPTIMIZATION 4Y SPRINGER CONTENTS 1 INTRODUCTION: MACHINE
LEARNING FOR INTELLIGENT OPTIMIZATION 1 1.1 PARAMETER TUNING AND
INTELLIGENT OPTIMIZATION 4 1.2 BOOK OUTLINE 7 2 REACTING ON THE
NEIGHBORHOOD 9 2.1 LOCAL SEARCH BASED ON PERTURBATIONS 9 2.2 LEARNING
HOW TO EVALUATE THE NEIGHBORHOOD 13 2.3 LEARNING THE APPROPRIATE
NEIGHBORHOOD IN VARIABLE NEIGHBORHOOD SEARCH 14 2.4 ITERATED LOCAL
SEARCH 18 3 REACTING ON THE ANNEALING SCHEDULE 25 3.1 STOCHASTICITY IN
LOCAL MOVES AND CONTROLLED WORSENING OF SOLUTION VALUES 25 3.2 SIMULATED
ANNEALING AND ASYMPTOTICS 26 3.2.1 ASYMPTOTIC CONVERGENCE RESULTS 27 3.3
ONLINE LEARNING STRATEGIES IN SIMULATED ANNEALING 29 3.3.1 COMBINATORIAL
OPTIMIZATION PROBLEMS 30 3.3.2 GLOBAL OPTIMIZATION OF CONTINUOUS
FUNCTIONS 33 4 REACTIVE PROHIBITIONS 35 4.1 PROHIBITIONS FOR
DIVERSIFICATION 35 4.1.1 FORMS OF PROHIBITION-BASED SEARCH 36 4.1.2
DYNAMICAL SYSTEMS 37 4.1.3 A WORKED-OUT EXAMPLE OF FIXED TABU SEARCH 39
4.1.4 RELATIONSHIP BETWEEN PROHIBITION AND DIVERSIFICATION 39 4.1.5 HOW
TO ESCAPE FROM AN ATTRACTOR 41 4.2 REACTIVE TABU SEARCH: SELF-ADJUSTED
PROHIBITION PERIOD 49 4.2.1 THE ESCAPE MECHANISM 51 4.2.2 APPLICATIONS
OF REACTIVE TABU SEARCH 51 V VI CONTENTS 4.3 IMPLEMENTATION: STORING AND
USING THE SEARCH HISTORY 52 4.3.1 FAST ALGORITHMS FOR USING THE SEARCH
HISTORY 54 4.3.2 PERSISTENT DYNAMIC SETS 54 5 REACTING ON THE OBJECTIVE
FUNCTION 59 5.1 DYNAMIC LANDSCAPE MODIFICATIONS TO INFLUENCE
TRAJECTORIES 59 5.1.1 ADAPTING NOISE LEVELS 62 5.1.2 GUIDED LOCAL SEARCH
63 5.2 ELIMINATING PLATEAUS BY LOOKING INSIDE THE PROBLEM STRUCTURE 66
5.2.1 NONOBLIVIOUS LOCAL SEARCH FOR SAT 66 6 MODEL-BASED SEARCH 69 6. 1
MODELS OF A PROBLEM 69 6.2 AN EXAMPLE 71 6.3 DEPENDENT PROBABILITIES 73
6.4 THE CROSS-ENTROPY MODEL 75 6.5 ADAPTIVE SOLUTION CONSTRUCTION WITH
ANT COLONIES 77 6.6 MODELING SURFACES FOR CONTINUOUS OPTIMIZATION 79 7
SUPERVISED LEARNING 83 7.1 LEARNING TO OPTIMIZE, FROM EXAMPLES 83 7.2
TECHNIQUES 84 7.2.1 LINEAR REGRESSION 84 7.2.2 BAYESIAN LOCALLY WEIGHTED
REGRESSION 88 7.2.3 USING LINEAR FUNCTIONS FOR CLASSIFICATION 92 7.2.4
MULTILAYER PERCEPTRONS 94 7.2.5 STATISTICAL LEARNING THEORY AND SUPPORT
VECTOR MACHINES .. 95 7.2.6 NEAREST NEIGHBOR S METHODS 101 7.3 SELECTING
FEATURES 102 7.3.1 CORRELATION COEFFICIENT 104 7.3.2 CORRELATION RATIO
104 7.3.3 ENTROPY AND MUTUAL INFORMATION 105 7.4 APPLICATIONS 106 7.4.1
LEARNING A MODEL OF THE SOLVER 110 8 REINFORCEMENT LEARNING 117 8.1
REINFORCEMENT LEARNING BASICS: LEARNING FROM A CRITIC 117 8.1.1 MARKOV
DECISION PROCESSES 118 8.1.2 DYNAMIC PROGRAMMING 120 8.1.3
APPROXIMATIONS: REINFORCEMENT LEARNING AND NEURO-DYNAMIC PROGRAMMING 123
8.2 RELATIONSHIPS BETWEEN REINFORCEMENT LEARNING AND OPTIMIZATION 125
CONTENTS VII 9 ALGORITHM PORTFOLIOS AND RESTART STRATEGIES 1 29 9. 1
INTRODUCTION: PORTFOLIOS AND RESTARTS 129 9.2 PREDICTING THE PERFORMANCE
OF A PORTFOLIO FROM ITS COMPONENT ALGORITHMS 130 9.2.1 PARALLEL
PROCESSING 132 9.3 REACTIVE PORTFOLIOS 134 9.4 DEFINING AN OPTIMAL
RESTART TIME 135 9.5 REACTIVE RESTARTS 138 10 RACING 141 10.1
EXPLORATION AND EXPLOITATION OF CANDIDATE ALGORITHMS 141 10.2 RACING TO
MAXIMIZE CUMULATIVE REWARD BY INTERVAL ESTIMATION . .. 142 10.3 AIMING
AT THE MAXIMUM WITH THRESHOLD ASCENT 144 10.4 RACING FOR OFF-LINE
CONFIGURATION OF METAHEURISTICS 145 11 TEAMS OF INTERACTING SOLVERS 151
11.1 COMPLEX INTERACTION AND COORDINATION SCHEMES 151 11.2 GENETIC
ALGORITHMS AND EVOLUTION STRATEGIES 152 11.3 INTELLIGENT AND REACTIVE
SOLVER TEAMS 156 11.4 AN EXAMPLE: GOSSIPING OPTIMIZATION 159 11.4.1
EPIDEMIC COMMUNICATION FOR OPTIMIZATION 160 12 METRICS, LANDSCAPES, AND
FEATURES 163 12.1 HOW TO MEASURE AND MODEL PROBLEM DIFFICULTY 163 12.2
PHASE TRANSITIONS IN COMBINATORIAL PROBLEMS 164 12.3 EMPIRICAL MODELS
FOR FITNESS SURFACES 165 12.3.1 TUNABLE LANDSCAPES 168 12.4 MEASURING
LOCAL SEARCH COMPONENTS: DIVERSIFICATION AND BIAS .... 170 12.4.1 THE
DIVERSIFICATION-BIAS COMPROMISE (D-B PLOTS) 173 12.4.2 A CONJECTURE:
BETTER ALGORITHMS ARE PARETO-OPTIMAL IN D-B PLOTS 175 13 OPEN PROBLEMS
177 REFERENCES 181 INDEX 195
|
| adam_txt |
ROBERTO BATTITI * MAURO BRUNATO * FRANCO MASCIA REACTIVE SEARCH AND
INTELLIGENT OPTIMIZATION 4Y SPRINGER CONTENTS 1 INTRODUCTION: MACHINE
LEARNING FOR INTELLIGENT OPTIMIZATION 1 1.1 PARAMETER TUNING AND
INTELLIGENT OPTIMIZATION 4 1.2 BOOK OUTLINE 7 2 REACTING ON THE
NEIGHBORHOOD 9 2.1 LOCAL SEARCH BASED ON PERTURBATIONS 9 2.2 LEARNING
HOW TO EVALUATE THE NEIGHBORHOOD 13 2.3 LEARNING THE APPROPRIATE
NEIGHBORHOOD IN VARIABLE NEIGHBORHOOD SEARCH 14 2.4 ITERATED LOCAL
SEARCH 18 3 REACTING ON THE ANNEALING SCHEDULE 25 3.1 STOCHASTICITY IN
LOCAL MOVES AND CONTROLLED WORSENING OF SOLUTION VALUES 25 3.2 SIMULATED
ANNEALING AND ASYMPTOTICS 26 3.2.1 ASYMPTOTIC CONVERGENCE RESULTS 27 3.3
ONLINE LEARNING STRATEGIES IN SIMULATED ANNEALING 29 3.3.1 COMBINATORIAL
OPTIMIZATION PROBLEMS 30 3.3.2 GLOBAL OPTIMIZATION OF CONTINUOUS
FUNCTIONS 33 4 REACTIVE PROHIBITIONS 35 4.1 PROHIBITIONS FOR
DIVERSIFICATION 35 4.1.1 FORMS OF PROHIBITION-BASED SEARCH 36 4.1.2
DYNAMICAL SYSTEMS 37 4.1.3 A WORKED-OUT EXAMPLE OF FIXED TABU SEARCH 39
4.1.4 RELATIONSHIP BETWEEN PROHIBITION AND DIVERSIFICATION 39 4.1.5 HOW
TO ESCAPE FROM AN ATTRACTOR 41 4.2 REACTIVE TABU SEARCH: SELF-ADJUSTED
PROHIBITION PERIOD 49 4.2.1 THE ESCAPE MECHANISM 51 4.2.2 APPLICATIONS
OF REACTIVE TABU SEARCH 51 V VI CONTENTS 4.3 IMPLEMENTATION: STORING AND
USING THE SEARCH HISTORY 52 4.3.1 FAST ALGORITHMS FOR USING THE SEARCH
HISTORY 54 4.3.2 PERSISTENT DYNAMIC SETS 54 5 REACTING ON THE OBJECTIVE
FUNCTION 59 5.1 DYNAMIC LANDSCAPE MODIFICATIONS TO INFLUENCE
TRAJECTORIES 59 5.1.1 ADAPTING NOISE LEVELS 62 5.1.2 GUIDED LOCAL SEARCH
63 5.2 ELIMINATING PLATEAUS BY LOOKING INSIDE THE PROBLEM STRUCTURE 66
5.2.1 NONOBLIVIOUS LOCAL SEARCH FOR SAT 66 6 MODEL-BASED SEARCH 69 6. 1
MODELS OF A PROBLEM 69 6.2 AN EXAMPLE 71 6.3 DEPENDENT PROBABILITIES 73
6.4 THE CROSS-ENTROPY MODEL 75 6.5 ADAPTIVE SOLUTION CONSTRUCTION WITH
ANT COLONIES 77 6.6 MODELING SURFACES FOR CONTINUOUS OPTIMIZATION 79 7
SUPERVISED LEARNING 83 7.1 LEARNING TO OPTIMIZE, FROM EXAMPLES 83 7.2
TECHNIQUES 84 7.2.1 LINEAR REGRESSION 84 7.2.2 BAYESIAN LOCALLY WEIGHTED
REGRESSION 88 7.2.3 USING LINEAR FUNCTIONS FOR CLASSIFICATION 92 7.2.4
MULTILAYER PERCEPTRONS 94 7.2.5 STATISTICAL LEARNING THEORY AND SUPPORT
VECTOR MACHINES . 95 7.2.6 NEAREST NEIGHBOR'S METHODS 101 7.3 SELECTING
FEATURES 102 7.3.1 CORRELATION COEFFICIENT 104 7.3.2 CORRELATION RATIO
104 7.3.3 ENTROPY AND MUTUAL INFORMATION 105 7.4 APPLICATIONS 106 7.4.1
LEARNING A MODEL OF THE SOLVER 110 8 REINFORCEMENT LEARNING 117 8.1
REINFORCEMENT LEARNING BASICS: LEARNING FROM A CRITIC 117 8.1.1 MARKOV
DECISION PROCESSES 118 8.1.2 DYNAMIC PROGRAMMING 120 8.1.3
APPROXIMATIONS: REINFORCEMENT LEARNING AND NEURO-DYNAMIC PROGRAMMING 123
8.2 RELATIONSHIPS BETWEEN REINFORCEMENT LEARNING AND OPTIMIZATION 125
CONTENTS VII 9 ALGORITHM PORTFOLIOS AND RESTART STRATEGIES 1 29 9. 1
INTRODUCTION: PORTFOLIOS AND RESTARTS 129 9.2 PREDICTING THE PERFORMANCE
OF A PORTFOLIO FROM ITS COMPONENT ALGORITHMS 130 9.2.1 PARALLEL
PROCESSING 132 9.3 REACTIVE PORTFOLIOS 134 9.4 DEFINING AN OPTIMAL
RESTART TIME 135 9.5 REACTIVE RESTARTS 138 10 RACING 141 10.1
EXPLORATION AND EXPLOITATION OF CANDIDATE ALGORITHMS 141 10.2 RACING TO
MAXIMIZE CUMULATIVE REWARD BY INTERVAL ESTIMATION . . 142 10.3 AIMING
AT THE MAXIMUM WITH THRESHOLD ASCENT 144 10.4 RACING FOR OFF-LINE
CONFIGURATION OF METAHEURISTICS 145 11 TEAMS OF INTERACTING SOLVERS 151
11.1 COMPLEX INTERACTION AND COORDINATION SCHEMES 151 11.2 GENETIC
ALGORITHMS AND EVOLUTION STRATEGIES 152 11.3 INTELLIGENT AND REACTIVE
SOLVER TEAMS 156 11.4 AN EXAMPLE: GOSSIPING OPTIMIZATION 159 11.4.1
EPIDEMIC COMMUNICATION FOR OPTIMIZATION 160 12 METRICS, LANDSCAPES, AND
FEATURES 163 12.1 HOW TO MEASURE AND MODEL PROBLEM DIFFICULTY 163 12.2
PHASE TRANSITIONS IN COMBINATORIAL PROBLEMS 164 12.3 EMPIRICAL MODELS
FOR FITNESS SURFACES 165 12.3.1 TUNABLE LANDSCAPES 168 12.4 MEASURING
LOCAL SEARCH COMPONENTS: DIVERSIFICATION AND BIAS . 170 12.4.1 THE
DIVERSIFICATION-BIAS COMPROMISE (D-B PLOTS) 173 12.4.2 A CONJECTURE:
BETTER ALGORITHMS ARE PARETO-OPTIMAL IN D-B PLOTS 175 13 OPEN PROBLEMS
177 REFERENCES 181 INDEX 195 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Battiti, Roberto Brunato, Mauro Mascia, Franco |
| author_facet | Battiti, Roberto Brunato, Mauro Mascia, Franco |
| author_role | aut aut aut |
| author_sort | Battiti, Roberto |
| author_variant | r b rb m b mb f m fm |
| building | Verbundindex |
| bvnumber | BV035066842 |
| callnumber-first | Q - Science |
| callnumber-label | QA402 |
| callnumber-raw | QA402.5 |
| callnumber-search | QA402.5 |
| callnumber-sort | QA 3402.5 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 970 |
| ctrlnum | (OCoLC)231884196 (DE-599)DNB988791412 |
| 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 |
| discipline_str_mv | Mathematik |
| edition | [1. ed.] |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02020nam a2200517 cb4500</leader><controlfield tag="001">BV035066842</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120109 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080924s2008 gw ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N23,1285</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">988791412</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387096230</subfield><subfield code="c">Gb. : ca. EUR 81.59 (freier Pr.), ca. sfr 127.00 (freier Pr.)</subfield><subfield code="9">978-0-387-09623-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387096247</subfield><subfield code="9">978-0-387-09624-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)231884196</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB988791412</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-703</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA402.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.64</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Battiti, Roberto</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reactive search and intelligent optimization</subfield><subfield code="c">Roberto Battiti ; Mauro Brunato ; Franco Mascia</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[1. ed.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 196 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">Operations research, computer science interfaces series</subfield><subfield code="v">45</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Heuristic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Problem solving</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">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brunato, Mauro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mascia, Franco</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Operations research, computer science interfaces series</subfield><subfield code="v">45</subfield><subfield code="w">(DE-604)BV012124389</subfield><subfield code="9">45</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">GBV 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=016735280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016735280</subfield></datafield></record></collection> |
| id | DE-604.BV035066842 |
| illustrated | Illustrated |
| index_date | 2024-07-02T22:02:37Z |
| indexdate | 2024-07-09T21:21:26Z |
| institution | BVB |
| isbn | 9780387096230 9780387096247 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016735280 |
| oclc_num | 231884196 |
| open_access_boolean | |
| owner | DE-703 DE-29T DE-11 |
| owner_facet | DE-703 DE-29T DE-11 |
| physical | X, 196 S. Ill., graph. Darst. |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| series | Operations research, computer science interfaces series |
| series2 | Operations research, computer science interfaces series |
| spelling | Battiti, Roberto Verfasser aut Reactive search and intelligent optimization Roberto Battiti ; Mauro Brunato ; Franco Mascia [1. ed.] New York, NY Springer 2008 X, 196 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Operations research, computer science interfaces series 45 Combinatorial optimization Heuristic programming Problem solving Optimierung (DE-588)4043664-0 gnd rswk-swf Maschinelles Lernen (DE-588)4193754-5 gnd rswk-swf Maschinelles Lernen (DE-588)4193754-5 s Optimierung (DE-588)4043664-0 s DE-604 Brunato, Mauro Verfasser aut Mascia, Franco Verfasser aut Operations research, computer science interfaces series 45 (DE-604)BV012124389 45 GBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016735280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Battiti, Roberto Brunato, Mauro Mascia, Franco Reactive search and intelligent optimization Operations research, computer science interfaces series Combinatorial optimization Heuristic programming Problem solving Optimierung (DE-588)4043664-0 gnd Maschinelles Lernen (DE-588)4193754-5 gnd |
| subject_GND | (DE-588)4043664-0 (DE-588)4193754-5 |
| title | Reactive search and intelligent optimization |
| title_auth | Reactive search and intelligent optimization |
| title_exact_search | Reactive search and intelligent optimization |
| title_exact_search_txtP | Reactive search and intelligent optimization |
| title_full | Reactive search and intelligent optimization Roberto Battiti ; Mauro Brunato ; Franco Mascia |
| title_fullStr | Reactive search and intelligent optimization Roberto Battiti ; Mauro Brunato ; Franco Mascia |
| title_full_unstemmed | Reactive search and intelligent optimization Roberto Battiti ; Mauro Brunato ; Franco Mascia |
| title_short | Reactive search and intelligent optimization |
| title_sort | reactive search and intelligent optimization |
| topic | Combinatorial optimization Heuristic programming Problem solving Optimierung (DE-588)4043664-0 gnd Maschinelles Lernen (DE-588)4193754-5 gnd |
| topic_facet | Combinatorial optimization Heuristic programming Problem solving Optimierung Maschinelles Lernen |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016735280&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV012124389 |
| work_keys_str_mv | AT battitiroberto reactivesearchandintelligentoptimization AT brunatomauro reactivesearchandintelligentoptimization AT masciafranco reactivesearchandintelligentoptimization |