Discrete optimization with interval data: minmax regret and fuzzy approach
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Berlin ; Heidelberg
Springer
2008
|
Schriftenreihe: | Studies in fuzziness and soft computing
Vol. 228 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Literaturverz. S. 209 - 215 |
Beschreibung: | XVI, 220 S. graph. Darst. 24 cm |
ISBN: | 9783540784838 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV035081985 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 081002s2008 gw d||| |||| 00||| eng d | ||
015 | |a 08,A36,0919 |2 dnb | ||
020 | |a 9783540784838 |c Pp. : EUR 106.95 (freier Pr.), sfr 174.00 (freier Pr.) |9 978-3-540-78483-8 | ||
024 | 3 | |a 9783540784838 | |
028 | 5 | 2 | |a 12235650 |
035 | |a (OCoLC)244625469 | ||
035 | |a (DE-599)BVBBV035081985 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c XA-DE | ||
049 | |a DE-19 | ||
082 | 0 | |a 519.64 |2 22/ger | |
084 | |a QH 422 |0 (DE-625)141576: |2 rvk | ||
084 | |a 510 |2 sdnb | ||
084 | |a 330 |2 sdnb | ||
100 | 1 | |a Kasperski, Adam |e Verfasser |4 aut | |
245 | 1 | 0 | |a Discrete optimization with interval data |b minmax regret and fuzzy approach |c Adam Kasperski |
264 | 1 | |a Berlin ; Heidelberg |b Springer |c 2008 | |
300 | |a XVI, 220 S. |b graph. Darst. |c 24 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Studies in fuzziness and soft computing |v Vol. 228 | |
500 | |a Literaturverz. S. 209 - 215 | ||
650 | 0 | 7 | |a Fuzzy-Optimierung |0 (DE-588)4659945-9 |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 Diskrete Optimierung |0 (DE-588)4150179-2 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Kombinatorische Optimierung |0 (DE-588)4031826-6 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Diskrete Optimierung |0 (DE-588)4150179-2 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Fuzzy-Optimierung |0 (DE-588)4659945-9 |D s |
689 | 2 | |5 DE-604 | |
830 | 0 | |a Studies in fuzziness and soft computing |v Vol. 228 |w (DE-604)BV021858135 |9 228 | |
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=016750214&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016750214 |
Datensatz im Suchindex
_version_ | 1804138034709397504 |
---|---|
adam_text | CONTENTS PART I: MINMAX REGRET COMBINATORIAL OPTIMIZATION PROBLEMS WITH
INTERVAL DATA 1 PROBLEM FORMULATION 3 1.1 DETERMINISTIC COMBINATORIAL
OPTIMIZATION PROBLEM 3 1.1.1 MATROIDAL PROBLEM 5 1.2 MINMAX REGRET
COMBINATORIAL OPTIMIZATION PROBLEM WITH INTERVAL DATA 6 1.3 SOME RELATED
PROBLEMS 9 1.3.1 OTHER ROBUSTNESS CRITERIA 9 1.3.2 PROBLEM WITH
MAXIMIZATION OBJECTIVE FUNCTION 11 1.3.3 PROBLEM WITH BOTTLENECK
OBJECTIVE FUNCTION 12 1.3.4 CENTRAL COMBINATORIAL OPTIMIZATION PROBLEM
14 1.4 NOTES AND REFERENCES 15 2 EVALUATION OF OPTIMALITY OF SOLUTIONS
AND ELEMENTS 17 2.1 EVALUATION OF OPTIMALITY OF SOLUTIONS 18 2.2
EVALUATION OF OPTIMALITY OF ELEMENTS 20 2.2.1 POSSIBLY OPTIMAL ELEMENTS
AND THE OPTIMAL ROBUST SOLUTIONS 22 2.2.2 NECESSARILY OPTIMAL ELEMENTS
AND THE OPTIMAL ROBUST SOLUTIONS 23 2.2.3 MATROIDAL PROBLEMS 25 2.3
NOTES AND REFERENCES 29 3 EXACT ALGORITHMS 31 3.1 MIXED INTEGER
PROGRAMMING FORMULATION 31 3.2 BRANCH AND BOUND ALGORITHM 35 3.3 NOTES
AND REFERENCES 37 GESCANNT DURCH BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/987489194 DIGITALISIERT DURCH * * * * * * * 217 XVI
CONTENTS 13 SEQUENCING PROBLEM WITH MAXIMUM LATENESS CRITERION .... 167
13.1 DETERMINISTIC PROBLEM AND LAWLER S ALGORITHM 167 13.2 POLYNOMIAL
ALGORITHM FOR THE PROBLEM 168 13.3 NOTES AND REFERENCES 173 14
SEQUENCING PROBLEM WITH WEIGHTED NUMBER OF LATE JOBS 175 14.1 MATROIDAL
STRUCTURE OF THE PROBLEM 176 14.2 POSSIBLY AND NECESSARILY OPTIMAL JOBS
178 14.3 MIXED INTEGER PROGRAMMING FORMULATION 179 14.3.1 COMPUTATIONAL
RESULTS 181 14.4 NOTES AND REFERENCES 182 15 SEQUENCING PROBLEM WITH THE
TOTAL FLOW TIME CRITERION ... 183 15.1 CHARACTERIZATION OF THE WORST
CASE SCENARIO 184 15.2 COMPUTATIONAL COMPLEXITY AND PREPROCESSING RULES
186 15.3 A 2-APPROXIMATION ALGORITHM 187 15.4 LOCAL SEARCH ALGORITHM 190
15.5 MIXED INTEGER PROGRAMMING FORMULATION 191 15.5.1 COMPUTATIONAL
RESULTS 193 15.6 NOTES AND REFERENCES 194 16 CONCLUSIONS AND OPEN
PROBLEMS 197 A DISCRETE SCENARIO REPRESENTATION OF UNCERTAINTY 199 A.I
MIP FORMULATION 199 A.2 COMPLEXITY RESULTS 200 A.3 APPROXIMATION 205
REFERENCES 209 INDEX
|
adam_txt |
CONTENTS PART I: MINMAX REGRET COMBINATORIAL OPTIMIZATION PROBLEMS WITH
INTERVAL DATA 1 PROBLEM FORMULATION 3 1.1 DETERMINISTIC COMBINATORIAL
OPTIMIZATION PROBLEM 3 1.1.1 MATROIDAL PROBLEM 5 1.2 MINMAX REGRET
COMBINATORIAL OPTIMIZATION PROBLEM WITH INTERVAL DATA 6 1.3 SOME RELATED
PROBLEMS 9 1.3.1 OTHER ROBUSTNESS CRITERIA 9 1.3.2 PROBLEM WITH
MAXIMIZATION OBJECTIVE FUNCTION 11 1.3.3 PROBLEM WITH BOTTLENECK
OBJECTIVE FUNCTION 12 1.3.4 CENTRAL COMBINATORIAL OPTIMIZATION PROBLEM
14 1.4 NOTES AND REFERENCES 15 2 EVALUATION OF OPTIMALITY OF SOLUTIONS
AND ELEMENTS 17 2.1 EVALUATION OF OPTIMALITY OF SOLUTIONS 18 2.2
EVALUATION OF OPTIMALITY OF ELEMENTS 20 2.2.1 POSSIBLY OPTIMAL ELEMENTS
AND THE OPTIMAL ROBUST SOLUTIONS 22 2.2.2 NECESSARILY OPTIMAL ELEMENTS
AND THE OPTIMAL ROBUST SOLUTIONS 23 2.2.3 MATROIDAL PROBLEMS 25 2.3
NOTES AND REFERENCES 29 3 EXACT ALGORITHMS 31 3.1 MIXED INTEGER
PROGRAMMING FORMULATION 31 3.2 BRANCH AND BOUND ALGORITHM 35 3.3 NOTES
AND REFERENCES 37 GESCANNT DURCH BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/987489194 DIGITALISIERT DURCH * * * * * * * 217 XVI
CONTENTS 13 SEQUENCING PROBLEM WITH MAXIMUM LATENESS CRITERION . 167
13.1 DETERMINISTIC PROBLEM AND LAWLER'S ALGORITHM 167 13.2 POLYNOMIAL
ALGORITHM FOR THE PROBLEM 168 13.3 NOTES AND REFERENCES 173 14
SEQUENCING PROBLEM WITH WEIGHTED NUMBER OF LATE JOBS 175 14.1 MATROIDAL
STRUCTURE OF THE PROBLEM 176 14.2 POSSIBLY AND NECESSARILY OPTIMAL JOBS
178 14.3 MIXED INTEGER PROGRAMMING FORMULATION 179 14.3.1 COMPUTATIONAL
RESULTS 181 14.4 NOTES AND REFERENCES 182 15 SEQUENCING PROBLEM WITH THE
TOTAL FLOW TIME CRITERION . 183 15.1 CHARACTERIZATION OF THE WORST
CASE SCENARIO 184 15.2 COMPUTATIONAL COMPLEXITY AND PREPROCESSING RULES
186 15.3 A 2-APPROXIMATION ALGORITHM 187 15.4 LOCAL SEARCH ALGORITHM 190
15.5 MIXED INTEGER PROGRAMMING FORMULATION 191 15.5.1 COMPUTATIONAL
RESULTS 193 15.6 NOTES AND REFERENCES 194 16 CONCLUSIONS AND OPEN
PROBLEMS 197 A DISCRETE SCENARIO REPRESENTATION OF UNCERTAINTY 199 A.I
MIP FORMULATION 199 A.2 COMPLEXITY RESULTS 200 A.3 APPROXIMATION 205
REFERENCES 209 INDEX |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Kasperski, Adam |
author_facet | Kasperski, Adam |
author_role | aut |
author_sort | Kasperski, Adam |
author_variant | a k ak |
building | Verbundindex |
bvnumber | BV035081985 |
classification_rvk | QH 422 |
ctrlnum | (OCoLC)244625469 (DE-599)BVBBV035081985 |
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 Wirtschaftswissenschaften |
discipline_str_mv | Mathematik Wirtschaftswissenschaften |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01977nam a2200505 cb4500</leader><controlfield tag="001">BV035081985</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">081002s2008 gw d||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,A36,0919</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540784838</subfield><subfield code="c">Pp. : EUR 106.95 (freier Pr.), sfr 174.00 (freier Pr.)</subfield><subfield code="9">978-3-540-78483-8</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540784838</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12235650</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)244625469</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035081985</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</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</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">QH 422</subfield><subfield code="0">(DE-625)141576:</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="084" ind1=" " ind2=" "><subfield code="a">330</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kasperski, Adam</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete optimization with interval data</subfield><subfield code="b">minmax regret and fuzzy approach</subfield><subfield code="c">Adam Kasperski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin ; Heidelberg</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 220 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">Studies in fuzziness and soft computing</subfield><subfield code="v">Vol. 228</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 209 - 215</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fuzzy-Optimierung</subfield><subfield code="0">(DE-588)4659945-9</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">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Diskrete Optimierung</subfield><subfield code="0">(DE-588)4150179-2</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">Fuzzy-Optimierung</subfield><subfield code="0">(DE-588)4659945-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Studies in fuzziness and soft computing</subfield><subfield code="v">Vol. 228</subfield><subfield code="w">(DE-604)BV021858135</subfield><subfield code="9">228</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=016750214&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-016750214</subfield></datafield></record></collection> |
id | DE-604.BV035081985 |
illustrated | Illustrated |
index_date | 2024-07-02T22:07:31Z |
indexdate | 2024-07-09T21:21:46Z |
institution | BVB |
isbn | 9783540784838 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016750214 |
oclc_num | 244625469 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM |
owner_facet | DE-19 DE-BY-UBM |
physical | XVI, 220 S. graph. Darst. 24 cm |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Springer |
record_format | marc |
series | Studies in fuzziness and soft computing |
series2 | Studies in fuzziness and soft computing |
spelling | Kasperski, Adam Verfasser aut Discrete optimization with interval data minmax regret and fuzzy approach Adam Kasperski Berlin ; Heidelberg Springer 2008 XVI, 220 S. graph. Darst. 24 cm txt rdacontent n rdamedia nc rdacarrier Studies in fuzziness and soft computing Vol. 228 Literaturverz. S. 209 - 215 Fuzzy-Optimierung (DE-588)4659945-9 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 gnd rswk-swf Diskrete Optimierung (DE-588)4150179-2 gnd rswk-swf Kombinatorische Optimierung (DE-588)4031826-6 s DE-604 Diskrete Optimierung (DE-588)4150179-2 s Fuzzy-Optimierung (DE-588)4659945-9 s Studies in fuzziness and soft computing Vol. 228 (DE-604)BV021858135 228 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016750214&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Kasperski, Adam Discrete optimization with interval data minmax regret and fuzzy approach Studies in fuzziness and soft computing Fuzzy-Optimierung (DE-588)4659945-9 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Diskrete Optimierung (DE-588)4150179-2 gnd |
subject_GND | (DE-588)4659945-9 (DE-588)4031826-6 (DE-588)4150179-2 |
title | Discrete optimization with interval data minmax regret and fuzzy approach |
title_auth | Discrete optimization with interval data minmax regret and fuzzy approach |
title_exact_search | Discrete optimization with interval data minmax regret and fuzzy approach |
title_exact_search_txtP | Discrete optimization with interval data minmax regret and fuzzy approach |
title_full | Discrete optimization with interval data minmax regret and fuzzy approach Adam Kasperski |
title_fullStr | Discrete optimization with interval data minmax regret and fuzzy approach Adam Kasperski |
title_full_unstemmed | Discrete optimization with interval data minmax regret and fuzzy approach Adam Kasperski |
title_short | Discrete optimization with interval data |
title_sort | discrete optimization with interval data minmax regret and fuzzy approach |
title_sub | minmax regret and fuzzy approach |
topic | Fuzzy-Optimierung (DE-588)4659945-9 gnd Kombinatorische Optimierung (DE-588)4031826-6 gnd Diskrete Optimierung (DE-588)4150179-2 gnd |
topic_facet | Fuzzy-Optimierung Kombinatorische Optimierung Diskrete Optimierung |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016750214&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV021858135 |
work_keys_str_mv | AT kasperskiadam discreteoptimizationwithintervaldataminmaxregretandfuzzyapproach |