A faster exact separation algorithm for blossom inequalities
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Chapter/Article |
| Language: | English |
| Published: |
2004
|
| In: |
Integer Programming and Combinatorial Optimization
Year: 2004, Pages: 196-205 |
| Online Access: |
|
| Author Notes: | Adam N. Letchford; Dirk O. Theis; Gerhard Reinelt |
MARC
| LEADER | 00000caa a22000002c 4500 | ||
|---|---|---|---|
| 001 | 1441682139 | ||
| 003 | DE-627 | ||
| 005 | 20220810190021.0 | ||
| 007 | tu | ||
| 008 | 120927s2004 xx ||||| 00| ||eng c | ||
| 035 | |a (DE-627)1441682139 | ||
| 035 | |a (DE-576)371682134 | ||
| 035 | |a (DE-599)BSZ371682134 | ||
| 035 | |a (OCoLC)1340428308 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Letchford, Adam N. |0 (DE-627)1437386075 |0 (DE-576)367386070 |4 aut | |
| 245 | 1 | 2 | |a A faster exact separation algorithm for blossom inequalities |c Adam N. Letchford; Dirk O. Theis; Gerhard Reinelt |
| 264 | 1 | |c 2004 | |
| 300 | |a 10 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 700 | 1 | |a Theis, Dirk |0 (DE-588)1026195977 |0 (DE-627)726261785 |0 (DE-576)185730868 |4 aut | |
| 700 | 1 | |a Reinelt, Gerhard |0 (DE-588)101987113X |0 (DE-627)691042861 |0 (DE-576)358936187 |4 aut | |
| 773 | 0 | 8 | |i In |t Integer Programming and Combinatorial Optimization |d Berlin : Springer, 2004 |g (2004), Seite 196-205 |h XI, 445 S. |w (DE-627)1611694957 |w (DE-576)11169969X |z 3540221131 |7 nnam |a A faster exact separation algorithm for blossom inequalities |
| 773 | 1 | 8 | |g year:2004 |g pages:196-205 |g extent:10 |a A faster exact separation algorithm for blossom inequalities |
| 951 | |a AR | ||
| 992 | |a 20120927 | ||
| 993 | |a BookComponentPart | ||
| 994 | |a 2004 | ||
| 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 3 |y j | ||
| 998 | |g 1026195977 |a Theis, Dirk Oliver |m 1026195977:Theis, Dirk Oliver |d 110000 |d 110300 |e 110000PT1026195977 |e 110300PT1026195977 |k 0/110000/ |k 1/110000/110300/ |p 2 | ||
| 999 | |a KXP-PPN1441682139 |e 2724220145 | ||
| BIB | |a Y | ||
| JSO | |a {"origin":[{"dateIssuedKey":"2004","dateIssuedDisp":"2004"}],"title":[{"title":"A faster exact separation algorithm for blossom inequalities","title_sort":"faster exact separation algorithm for blossom inequalities"}],"id":{"eki":["1441682139"]},"name":{"displayForm":["Adam N. Letchford; Dirk O. Theis; Gerhard Reinelt"]},"person":[{"given":"Adam N.","family":"Letchford","role":"aut","display":"Letchford, Adam N."},{"display":"Theis, Dirk","role":"aut","family":"Theis","given":"Dirk"},{"role":"aut","display":"Reinelt, Gerhard","given":"Gerhard","family":"Reinelt"}],"physDesc":[{"extent":"10 S."}],"type":{"bibl":"chapter"},"language":["eng"],"relHost":[{"part":{"text":"(2004), Seite 196-205","extent":"10","year":"2004","pages":"196-205"},"disp":"A faster exact separation algorithm for blossom inequalitiesInteger Programming and Combinatorial Optimization","type":{"bibl":"edited-book"},"corporate":[{"role":"oth","display":"International IPCO Conference (10, 2004, New York, NY)"}],"language":["eng"],"recId":"1611694957","title":[{"title_sort":"Integer Programming and Combinatorial Optimization","title":"Integer Programming and Combinatorial Optimization","subtitle":"10th International IPCO Conference, New York, NY, USA, June 7-11, 2004; proceedings"}],"person":[{"display":"Bienstock, Daniel","roleDisplay":"Hrsg.","role":"edt","family":"Bienstock","given":"Daniel"}],"relMultPart":[{"id":{"eki":["129300152"],"zdb":["121909-1"],"issn":["0302-9743"]},"origin":[{"publisher":"Springer ; Springer","dateIssuedKey":"1973","dateIssuedDisp":"1973-","publisherPlace":"Berlin, Germany ; Heidelberg, Germany ; Berlin ; Heidelberg ; New York, NY"}],"dispAlt":"Lecture notes in computer science","physDesc":[{"noteFormat":"24 cm"}],"title":[{"title":"Lecture notes in computer science","title_sort":"Lecture notes in computer science"}],"part":{"number_sort":["3064"],"number":["3064"]},"titleAlt":[{"title":"LNCS"},{"title":"LNAI"},{"title":"LNBI"},{"title":"LNCS-LNAI"},{"title":"LNCS-LNBI"},{"title":"LNCS-ARCoSS"}],"pubHistory":["1.1973 -"],"language":["eng"],"recId":"129300152","type":{"bibl":"serial"},"disp":"Lecture notes in computer science","note":["Ersch. teils auch als CD-ROM-Ausgabe","Das Gesamtwerk gliedert sich in: Lecture notes in artificial intelligence; Lecture notes in bioinformatics; Journal subline; Advanced research in computing and software science; FoLLI publications on logic, language and information"]}],"physDesc":[{"extent":"XI, 445 S.","noteIll":"graph. Darst."}],"origin":[{"dateIssuedDisp":"2004","publisher":"Springer","dateIssuedKey":"2004","publisherPlace":"Berlin ; Heidelberg [u.a.]"}],"id":{"isbn":["3540221131"],"eki":["1611694957"]},"name":{"displayForm":["Daniel Bienstock ... (Eds.)"]}}],"recId":"1441682139"} | ||
| SRT | |a LETCHFORDAFASTEREXAC2004 | ||