An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema:
The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the L...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Institute of Technology
1980
|
| Schlagworte: | |
| Zusammenfassung: | The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is self-contained in the sense that it can be externally attached to any LIFO branch-and-bound program without interfering with its algorithms and data structures. (Author). |
| Beschreibung: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876349 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t | ||
| 008 | 880307s1980 |||| 00||| eng d | ||
| 035 | |a (OCoLC)227435807 | ||
| 035 | |a (DE-599)BVBBV021876349 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-149 | ||
| 100 | 1 | |a Pallottino, Stefano |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |c Stefano Pallottino ; Tommaso Toffoli |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Institute of Technology |c 1980 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is self-contained in the sense that it can be externally attached to any LIFO branch-and-bound program without interfering with its algorithms and data structures. (Author). | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Flow charting |2 dtict | |
| 650 | 7 | |a Mathematical programming |2 dtict | |
| 650 | 7 | |a Optimization |2 dtict | |
| 650 | 7 | |a Searching |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 650 | 0 | 7 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Branch-and-Bound-Methode |0 (DE-588)4146449-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Toffoli, Tommaso |e Verfasser |4 aut | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015091968 | ||
Datensatz im Suchindex
| _version_ | 1804135815819821056 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Pallottino, Stefano Toffoli, Tommaso |
| author_facet | Pallottino, Stefano Toffoli, Tommaso |
| author_role | aut aut |
| author_sort | Pallottino, Stefano |
| author_variant | s p sp t t tt |
| building | Verbundindex |
| bvnumber | BV021876349 |
| ctrlnum | (OCoLC)227435807 (DE-599)BVBBV021876349 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02064nam a2200421zc 4500</leader><controlfield tag="001">BV021876349</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">880307s1980 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227435807</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876349</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-149</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pallottino, Stefano</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema</subfield><subfield code="c">Stefano Pallottino ; Tommaso Toffoli</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Institute of Technology</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 S.</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="520" ind1="3" ind2=" "><subfield code="a">The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is self-contained in the sense that it can be externally attached to any LIFO branch-and-bound program without interfering with its algorithms and data structures. (Author).</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Flow charting</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical programming</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Optimization</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Searching</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Branch-and-Bound-Methode</subfield><subfield code="0">(DE-588)4146449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Toffoli, Tommaso</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091968</subfield></datafield></record></collection> |
| id | DE-604.BV021876349 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:03:36Z |
| indexdate | 2024-07-09T20:46:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091968 |
| oclc_num | 227435807 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 9 S. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| publisher | Laboratory for Computer Science, Massachusetts Institute of Technology |
| record_format | marc |
| spelling | Pallottino, Stefano Verfasser aut An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema Stefano Pallottino ; Tommaso Toffoli Cambridge, Mass. Laboratory for Computer Science, Massachusetts Institute of Technology 1980 9 S. txt rdacontent n rdamedia nc rdacarrier The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is self-contained in the sense that it can be externally attached to any LIFO branch-and-bound program without interfering with its algorithms and data structures. (Author). Algorithms dtict Flow charting dtict Mathematical programming dtict Optimization dtict Searching dtict Theoretical Mathematics scgdst Branch-and-Bound-Methode (DE-588)4146449-7 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Branch-and-Bound-Methode (DE-588)4146449-7 s Toffoli, Tommaso Verfasser aut |
| spellingShingle | Pallottino, Stefano Toffoli, Tommaso An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema Algorithms dtict Flow charting dtict Mathematical programming dtict Optimization dtict Searching dtict Theoretical Mathematics scgdst Branch-and-Bound-Methode (DE-588)4146449-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4146449-7 (DE-588)4001183-5 |
| title | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |
| title_auth | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |
| title_exact_search | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |
| title_exact_search_txtP | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |
| title_full | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema Stefano Pallottino ; Tommaso Toffoli |
| title_fullStr | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema Stefano Pallottino ; Tommaso Toffoli |
| title_full_unstemmed | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema Stefano Pallottino ; Tommaso Toffoli |
| title_short | An efficient algorithm for determining the length of the longest dead path in an "LIFO" branch-and-bound exploration schema |
| title_sort | an efficient algorithm for determining the length of the longest dead path in an lifo branch and bound exploration schema |
| topic | Algorithms dtict Flow charting dtict Mathematical programming dtict Optimization dtict Searching dtict Theoretical Mathematics scgdst Branch-and-Bound-Methode (DE-588)4146449-7 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithms Flow charting Mathematical programming Optimization Searching Theoretical Mathematics Branch-and-Bound-Methode Algorithmus |
| work_keys_str_mv | AT pallottinostefano anefficientalgorithmfordeterminingthelengthofthelongestdeadpathinanlifobranchandboundexplorationschema AT toffolitommaso anefficientalgorithmfordeterminingthelengthofthelongestdeadpathinanlifobranchandboundexplorationschema |