{"id":"https://openalex.org/W1488120084","doi":"https://doi.org/10.1007/3-540-45535-3","title":"Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings","display_name":"Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings","publication_year":2001,"publication_date":"2001-06-27","ids":{"openalex":"https://openalex.org/W1488120084","doi":"https://doi.org/10.1007/3-540-45535-3","mag":"1488120084"},"language":"en","primary_location":{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-009405731","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Konferenzschrift"},"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023942331","display_name":"Karen Aardal","orcid":"https://orcid.org/0000-0001-5974-6219"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karen Aardal","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-5974-6219","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017120383","display_name":"A.M.H. Gerards","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A.M.H. Gerards","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11456875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6360880136489868},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.58391273021698},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5390275120735168},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5231995582580566},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.522986650466919},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.51576828956604},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4668805003166199},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.463002473115921},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.43181395530700684},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4253196716308594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42209097743034363},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4191463589668274},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4125777781009674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2954012155532837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21428942680358887},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.19013094902038574}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6360880136489868},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.58391273021698},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5390275120735168},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5231995582580566},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.522986650466919},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.51576828956604},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4668805003166199},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.463002473115921},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.43181395530700684},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4253196716308594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42209097743034363},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4191463589668274},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4125777781009674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2954012155532837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21428942680358887},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.19013094902038574},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-009405731","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Konferenzschrift"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-017053099","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45535-3","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"software, multimedia"},{"id":"pmh:tue:oai:pure.tue.nl:publications/88d30b7b-e584-41e9-9204-83806df36b74","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/88d30b7b-e584-41e9-9204-83806df36b74","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/book"},{"id":"mag:1488120084","is_oa":false,"landing_page_url":"https://ci.nii.ac.jp/ncid/BA52391491","pdf_url":null,"source":{"id":"https://openalex.org/S4210197683","display_name":"Medical Entomology and Zoology","issn_l":"0424-7086","issn":["0424-7086","2185-5609"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319750","host_organization_name":"Japan Society of Medical Entomology and Zoology","host_organization_lineage":["https://openalex.org/P4310319750"],"host_organization_lineage_names":["Japan Society of Medical Entomology and Zoology"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1531500319","https://openalex.org/W1600437548","https://openalex.org/W1602816720","https://openalex.org/W1604655363","https://openalex.org/W1539835668","https://openalex.org/W1578031358","https://openalex.org/W2164859698","https://openalex.org/W1553557824","https://openalex.org/W2075081186","https://openalex.org/W2162898372","https://openalex.org/W2003391451","https://openalex.org/W53087745","https://openalex.org/W1976584101","https://openalex.org/W2064625402","https://openalex.org/W2107843968","https://openalex.org/W2150361102","https://openalex.org/W1994932713","https://openalex.org/W2140566134","https://openalex.org/W2170344325","https://openalex.org/W1695878779"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}