{ "labelLang" : "hun", "responseDate" : "2024-03-28 21:12", "content" : { "otype" : "Book", "mtid" : 30109225, "status" : "APPROVED", "published" : true, "unhandledTickets" : 0, "oldTimestamp" : "2018-09-14T10:20:40.000+0000", "deleted" : false, "lastRefresh" : "2024-03-25T04:14:15.522+0000", "lastModified" : "2023-02-01T17:54:27.068+0000", "created" : "2013-03-25T17:45:55.000+0000", "creator" : { "otype" : "Author", "mtid" : 10010316, "link" : "/api/author/10010316", "label" : "Benczúr András, ifj (Alkalmazott matematika)", "familyName" : "Benczúr", "givenName" : "András, ifj", "published" : true, "oldId" : 10010316, "snippet" : true }, "lastDuplumOK" : "2023-02-01T17:54:27.963+0000", "lastDuplumSearch" : "2023-02-01T17:54:27.963+0000", "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000144, "link" : "/api/subtype/10000144", "label" : "Konferenciakötet (Könyv)", "name" : "Konferenciakötet", "nameEng" : "Conference proceedings", "docType" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "listPosition" : 345, "published" : true, "oldId" : 10000144, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Cook, William", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 27752522, "link" : "/api/authorship/27752522", "label" : "Cook, William [szerk.]", "listPosition" : 1, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Cook", "givenName" : "William", "authorTyped" : false, "editorTyped" : true, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 2, "link" : "/api/authorshiptype/2", "label" : "Szerkesztő", "code" : -1, "published" : true, "oldId" : -1, "snippet" : true }, "published" : false, "oldId" : 41752075, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 27752523, "link" : "/api/authorship/27752523", "label" : "Schulz, Andreas S [szerk.]", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Schulz", "givenName" : "Andreas S", "authorTyped" : false, "editorTyped" : true, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 2, "link" : "/api/authorshiptype/2", "label" : "Szerkesztő", "code" : -1, "published" : true, "oldId" : -1, "snippet" : true }, "published" : false, "oldId" : 41752074, "snippet" : true } ], "title" : "9th International IPCO Conference: Integer Programming and Combinatorial Optimization", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 2409886, "link" : "/api/publicationidentifier/2409886", "label" : "ISBN: 3540436766", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "3540436766", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A3540436766", "published" : false, "snippet" : true } ], "seriesMembers" : [ { "otype" : "SeriesVolume", "mtid" : 93828, "link" : "/api/seriesvolume/93828", "label" : "Lecture Notes in Computer Science 0302-9743 1611-3349, 2337", "publication" : { "otype" : "Book", "mtid" : 30109225, "link" : "/api/publication/30109225", "label" : "Cook William. 9th International IPCO Conference: Integer Programming and Combinatorial Optimization. (2002) ISBN:3540436766", "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000144, "link" : "/api/subtype/10000144", "label" : "Konferenciakötet (Könyv)", "name" : "Konferenciakötet", "nameEng" : "Conference proceedings", "docType" : { "otype" : "PublicationType", "mtid" : 23, "link" : "/api/publicationtype/23", "label" : "Könyv", "code" : 23, "otypeName" : "Book", "listPosition" : 3, "published" : true, "oldId" : 23, "snippet" : true }, "listPosition" : 345, "published" : true, "oldId" : 10000144, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "9th International IPCO Conference: Integer Programming and Combinatorial Optimization", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 2409886, "link" : "/api/publicationidentifier/2409886", "label" : "ISBN: 3540436766", "source" : { "otype" : "PlainSource", "mtid" : 122, "link" : "/api/publicationsource/122", "label" : "ISBN", "type" : { "otype" : "PublicationSourceType", "mtid" : 10002, "link" : "/api/publicationsourcetype/10002", "label" : "Egyéb", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "ISBN", "nameEng" : "ISBN", "linkPattern" : "https://www.worldcat.org/search?q=isbn%3A@@@", "publiclyVisible" : true, "published" : true, "oldId" : 122, "snippet" : true }, "idValue" : "3540436766", "realUrl" : "https://www.worldcat.org/search?q=isbn%3A3540436766", "published" : false, "snippet" : true } ], "publishedAt" : [ { "otype" : "City", "mtid" : 10489, "link" : "/api/city/10489", "label" : "Berlin, Németország", "partOf" : { "otype" : "Country", "mtid" : 10011, "link" : "/api/country/10011", "label" : "Németország", "published" : true, "oldId" : 5, "snippet" : true }, "published" : true, "oldId" : 1022992, "snippet" : true } ], "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "snippet" : true }, "series" : { "otype" : "BookSeries", "mtid" : 20000018, "link" : "/api/bookseries/20000018", "label" : "Lecture Notes in Computer Science 0302-9743 1611-3349", "pIssn" : "0302-9743", "eIssn" : "1611-3349", "noIF" : false, "sciIndexed" : false, "scopusIndexed" : false, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "snippet" : true }, "published" : false, "snippet" : true } ], "publishers" : [ { "otype" : "Publisher", "mtid" : 50952, "link" : "/api/publisher/50952", "label" : "Springer Netherlands", "name" : "Springer Netherlands", "published" : true, "snippet" : true } ], "publishedAt" : [ { "otype" : "City", "mtid" : 10489, "link" : "/api/city/10489", "label" : "Berlin, Németország", "partOf" : { "otype" : "Country", "mtid" : 10011, "link" : "/api/country/10011", "label" : "Németország", "published" : true, "oldId" : 5, "snippet" : true }, "published" : true, "oldId" : 1022992, "snippet" : true } ], "firstPageOrInternalIdForSort" : "", "publishedYear" : 2002, "conference" : { "otype" : "Conference", "mtid" : 68158, "link" : "/api/conference/68158", "label" : "9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002 2002-05-27 [Cambridge, Amerikai Egyesült Államok]", "location" : [ { "otype" : "City", "mtid" : 14686, "link" : "/api/city/14686", "label" : "Cambridge, Amerikai Egyesült Államok", "partOf" : { "otype" : "Country", "mtid" : 10017, "link" : "/api/country/10017", "label" : "Amerikai Egyesült Államok", "published" : true, "oldId" : 13, "snippet" : true }, "published" : true, "oldId" : 10005908, "snippet" : true } ], "published" : true, "snippet" : true }, "digital" : null, "printed" : null, "sourceYear" : 2020, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "nationalOrigin" : false, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-03-25", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 0, "citedCount" : 0, "hasCitationDuplums" : false, "userChangeableUntil" : "2013-06-23T16:45:55.000+0000", "publishDate" : "2013-04-17T16:30:49.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 4, "ownerInstituteCount" : 33, "directInstituteCount" : 0, "authorCount" : 0, "contributorCount" : 2, "chapterCount" : 5, "chapters" : [ { "otype" : "BookChapter", "mtid" : 33219947, "link" : "/api/publication/33219947", "label" : "Dash S.. An exponential lower bound on the length of some classes of branch-and-cut proofs. (2002) Megjelent: 9th International IPCO Conference: Integer Programming and Combinatorial Optimization pp. 145-160", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "An exponential lower bound on the length of some classes of branch-and-cut proofs", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22019225, "link" : "/api/publicationidentifier/22019225", "label" : "DOI: 10.1007/3-540-47867-1_11", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "10.1007/3-540-47867-1_11", "realUrl" : "https://doi.org/10.1007/3-540-47867-1_11", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22019224, "link" : "/api/publicationidentifier/22019224", "label" : "Scopus: 77950506014", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "77950506014", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77950506014", "published" : false, "snippet" : true } ], "volume" : "2337 LNCS", "publishedAt" : [ ], "pageLength" : 16, "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "DUPLUM", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33258496, "link" : "/api/publication/33258496", "label" : "Jansen K. et al. On preemptive resource constrained scheduling: Polynomial-time approximation schemes. (2002) Megjelent: 9th International IPCO Conference: Integer Programming and Combinatorial Optimization pp. 329-349", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "On preemptive resource constrained scheduling: Polynomial-time approximation schemes", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22123118, "link" : "/api/publicationidentifier/22123118", "label" : "DOI: 10.1007/3-540-47867-1_24", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "idValue" : "10.1007/3-540-47867-1_24", "realUrl" : "https://doi.org/10.1007/3-540-47867-1_24", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22123117, "link" : "/api/publicationidentifier/22123117", "label" : "Scopus: 84868660361", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "idValue" : "84868660361", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84868660361", "published" : false, "snippet" : true } ], "volume" : "2337 LNCS", "publishedAt" : [ ], "pageLength" : 21, "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 33252346, "link" : "/api/publication/33252346", "label" : "Jansen K. et al. On preemptive resource constrained scheduling: Polynomial-time approximation schemes. (2002) Megjelent: 9th International IPCO Conference: Integer Programming and Combinatorial Optimization pp. 329-349", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "On preemptive resource constrained scheduling: Polynomial-time approximation schemes", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 22107484, "link" : "/api/publicationidentifier/22107484", "label" : "DOI: 10.1007/3-540-47867-1_24", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "idValue" : "10.1007/3-540-47867-1_24", "realUrl" : "https://doi.org/10.1007/3-540-47867-1_24", "published" : false, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 22107483, "link" : "/api/publicationidentifier/22107483", "label" : "Scopus: 84868660361", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "idValue" : "84868660361", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84868660361", "published" : false, "snippet" : true } ], "volume" : "2337 LNCS", "publishedAt" : [ ], "pageLength" : 21, "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "duplumRole" : "SUSPECT", "published" : true, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 20616622, "link" : "/api/publication/20616622", "label" : "Spille B et al. A Generalization of Edmonds' Matching and Matroid Intersection Algorithms. (2002) Megjelent: 9th International IPCO Conference: Integer Programming and Combinatorial Optimization pp. 9-20", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "A Generalization of Edmonds' Matching and Matroid Intersection Algorithms", "identifiers" : [ ], "publishedAt" : [ ], "pageLength" : 12, "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "oldId" : 10616622, "snippet" : true }, { "otype" : "BookChapter", "mtid" : 23052815, "link" : "/api/publication/23052815", "label" : "Wenger Klaus Michael. A new approach to cactus construction applied to TSP support graphs. (2002) Megjelent: 9th International IPCO Conference: Integer Programming and Combinatorial Optimization pp. 109-126", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000312, "link" : "/api/subtype/10000312", "label" : "Konferenciaközlemény (Könyvrészlet)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 25, "link" : "/api/publicationtype/25", "label" : "Könyvrészlet", "code" : 25, "otypeName" : "BookChapter", "listPosition" : 2, "published" : true, "oldId" : 25, "snippet" : true }, "listPosition" : 228, "published" : true, "oldId" : 10000312, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "A new approach to cactus construction applied to TSP support graphs", "identifiers" : [ ], "publishedAt" : [ ], "pageLength" : 18, "publishedYear" : 2002, "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : false, "published" : true, "oldId" : 13052815, "snippet" : true } ], "fromCitation" : true, "hasQualityFactor" : false, "link" : "/api/publication/30109225", "label" : "Cook William. 9th International IPCO Conference: Integer Programming and Combinatorial Optimization. (2002) ISBN:3540436766", "template" : "