A branch-and-bound algorithm for the coupled task problem
Saved in:
| Other Authors: | , , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2014
|
| In: |
Mathematical methods of operations research
Year: 2014, Volume: 80, Issue: 1, Pages: 47-81 |
| ISSN: | 1432-2994 |
| Online Access: |
|
| Author Notes: | József Békési; Gábor Galambos; Michael N. Jung; Marcus Oswald; Gerhard Reinelt |
MARC
| LEADER | 00000caa a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 797379770 | ||
| 003 | DE-627 | ||
| 005 | 20260212141852.0 | ||
| 007 | tu | ||
| 008 | 140924s2014 xx ||||| 00| ||eng c | ||
| 035 | |a (DE-627)797379770 | ||
| 035 | |a (DE-576)9797379779 | ||
| 035 | |a (DE-599)GBV797379770 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 0 | 2 | |a A branch-and-bound algorithm for the coupled task problem |c József Békési; Gábor Galambos; Michael N. Jung; Marcus Oswald; Gerhard Reinelt |
| 264 | 1 | |c 2014 | |
| 300 | |b graph. Darst. | ||
| 300 | |a 35 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 650 | 4 | |a Coupled task problem |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Branch-and-bound |7 (dpeaa)DE-206 | |
| 650 | 4 | |a Integer programming |7 (dpeaa)DE-206 | |
| 700 | 1 | |a Békési, József |4 oth | |
| 700 | 1 | |a Galambos, Gabor |0 (DE-588)171340191 |0 (DE-627)061530921 |0 (DE-576)132141531 |4 oth | |
| 700 | 1 | |a Jung, Michael |0 (DE-588)1047691043 |0 (DE-627)778924408 |0 (DE-576)40150722X |4 oth | |
| 700 | 1 | |a Oswald, Marcus |d 1971- |0 (DE-588)138688125 |0 (DE-627)604919719 |0 (DE-576)308608631 |4 oth | |
| 700 | 1 | |a Reinelt, Gerhard |0 (DE-588)101987113X |0 (DE-627)691042861 |0 (DE-576)358936187 |4 oth | |
| 773 | 0 | 8 | |i In |t Mathematical methods of operations research |d Berlin : Springer, 1996 |g 80(2014), 1 vom: Aug., Seite 47-81 |w (DE-627)195962478 |w (DE-600)1310695-8 |w (DE-576)051452545 |x 1432-2994 |7 nnas |a A branch-and-bound algorithm for the coupled task problem |
| 773 | 1 | 8 | |g volume:80 |g year:2014 |g number:1 |g month:08 |g pages:47-81 |g extent:35 |a A branch-and-bound algorithm for the coupled task problem |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t A branch-and-bound algorithm for the coupled task problem |d 2014 |w (DE-627)1503260801 |w (DE-576)433260807 |
| 951 | |a AR | ||
| 992 | |a 20260212 | ||
| 993 | |a Article | ||
| 998 | |g 101987113X |a Reinelt, Gerhard |m 101987113X:Reinelt, Gerhard |d 110000 |d 110300 |e 110000PR101987113X |e 110300PR101987113X |k 0/110000/ |k 1/110000/110300/ |p 5 |y j | ||
| 998 | |g 138688125 |a Oswald, Marcus |m 138688125:Oswald, Marcus |d 110000 |d 110300 |e 110000PO138688125 |e 110300PO138688125 |k 0/110000/ |k 1/110000/110300/ |p 4 | ||
| 998 | |g 1047691043 |a Jung, Michael |m 1047691043:Jung, Michael |d 700000 |d 708000 |e 700000PJ1047691043 |e 708000PJ1047691043 |k 0/700000/ |k 1/700000/708000/ |p 3 | ||
| 999 | |a KXP-PPN797379770 |e 4914084376 | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"language":["eng"],"physDesc":[{"noteIll":"graph. Darst.","extent":"35 S."}],"title":[{"title":"A branch-and-bound algorithm for the coupled task problem","title_sort":"branch-and-bound algorithm for the coupled task problem"}],"name":{"displayForm":["József Békési; Gábor Galambos; Michael N. Jung; Marcus Oswald; Gerhard Reinelt"]},"id":{"eki":["797379770"]},"recId":"797379770","origin":[{"dateIssuedDisp":"2014","dateIssuedKey":"2014"}],"type":{"bibl":"article-journal"},"person":[{"role":"oth","display":"Békési, József","family":"Békési","given":"József"},{"role":"oth","family":"Galambos","display":"Galambos, Gabor","given":"Gabor"},{"role":"oth","display":"Jung, Michael","family":"Jung","given":"Michael"},{"given":"Marcus","display":"Oswald, Marcus","family":"Oswald","role":"oth"},{"given":"Gerhard","role":"oth","family":"Reinelt","display":"Reinelt, Gerhard"}],"relHost":[{"type":{"bibl":"periodical"},"titleAlt":[{"title":"ZOR"},{"title":"MMOR"},{"title":"Math Meth Oper Res"}],"recId":"195962478","disp":"A branch-and-bound algorithm for the coupled task problemMathematical methods of operations research","part":{"text":"80(2014), 1 vom: Aug., Seite 47-81","extent":"35","issue":"1","year":"2014","volume":"80","pages":"47-81"},"pubHistory":["43.1996 -"],"id":{"issn":["1432-2994"],"eki":["195962478"],"zdb":["1310695-8"]},"origin":[{"publisher":"Springer ; Physica-Verl.","publisherPlace":"Berlin ; Heidelberg ; Heidelberg","dateIssuedKey":"1996","dateIssuedDisp":"1996-"}],"physDesc":[{"noteFormat":"24 cm"}],"title":[{"title":"Mathematical methods of operations research","title_sort":"Mathematical methods of operations research"}],"language":["eng"]}]} | ||
| SRT | |a BRANCHANDB2014 | ||