{"id":"https://openalex.org/W1589357619","doi":"https://doi.org/10.1007/3-540-48481-7_12","title":"Convex Quadratic Programming Relaxations for Network Scheduling Problems","display_name":"Convex Quadratic Programming Relaxations for Network Scheduling Problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1589357619","doi":"https://doi.org/10.1007/3-540-48481-7_12","mag":"1589357619"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48481-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48481-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"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/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["CZ","DE"],"is_corresponding":true,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Department of Applied Mathematics and DIMATIA Centre, Charles University, Malostransk\u00e1 n\u00e1m. 25, CZ-11800, Prague 1, Czech Republic","Technische Universitat Berlin"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and DIMATIA Centre, Charles University, Malostransk\u00e1 n\u00e1m. 25, CZ-11800, Prague 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Technische Universitat Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055693054"],"corresponding_institution_ids":["https://openalex.org/I21250087","https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":12.3284,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.98798587,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"138"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/computer-science","display_name":"Computer science","score":0.7480319142341614},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6448434591293335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6119818091392517},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5726791620254517},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5475519895553589},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.543434739112854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5298737287521362},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5043569803237915},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4717070758342743},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45547154545783997},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45197200775146484},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41669002175331116},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4106445610523224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3230332136154175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1804901659488678}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7480319142341614},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6448434591293335},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6119818091392517},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5726791620254517},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5475519895553589},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.543434739112854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5298737287521362},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5043569803237915},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4717070758342743},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45547154545783997},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45197200775146484},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41669002175331116},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4106445610523224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3230332136154175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1804901659488678},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-48481-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48481-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.3063","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.3063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-629-1999.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1534232504","https://openalex.org/W1544188233","https://openalex.org/W1589357619","https://openalex.org/W1593498433","https://openalex.org/W1668808034","https://openalex.org/W1739020267","https://openalex.org/W1988328380","https://openalex.org/W1989582918","https://openalex.org/W1993200481","https://openalex.org/W2014369282","https://openalex.org/W2022191808","https://openalex.org/W2031612682","https://openalex.org/W2040475938","https://openalex.org/W2056273707","https://openalex.org/W2080167233","https://openalex.org/W2085325317","https://openalex.org/W2102588682","https://openalex.org/W2109166972","https://openalex.org/W2115931985","https://openalex.org/W2121129818","https://openalex.org/W2148204686","https://openalex.org/W2159152246","https://openalex.org/W2179016037","https://openalex.org/W2743045177","https://openalex.org/W4210953350","https://openalex.org/W6637700038","https://openalex.org/W7063798335"],"related_works":["https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W1991979416","https://openalex.org/W2593080689","https://openalex.org/W2254726702","https://openalex.org/W2952143488","https://openalex.org/W2395976569","https://openalex.org/W2962917430","https://openalex.org/W276709744"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}