{"id":"https://openalex.org/W2278496192","doi":"https://doi.org/10.1007/978-3-662-48350-3_71","title":"A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem","display_name":"A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2278496192","doi":"https://doi.org/10.1007/978-3-662-48350-3_71","mag":"2278496192"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-48350-3_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_71","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/A5089622908","display_name":"Adam Kurpisz","orcid":"https://orcid.org/0000-0002-2320-4482"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Adam Kurpisz","raw_affiliation_strings":["IDSIA, 6928, Manno, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, 6928, Manno, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015405497","display_name":"Samuli Lepp\u00e4nen","orcid":"https://orcid.org/0009-0006-0169-6224"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Samuli Lepp\u00e4nen","raw_affiliation_strings":["IDSIA, 6928, Manno, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, 6928, Manno, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053978143","display_name":"Monaldo Mastrolilli","orcid":"https://orcid.org/0000-0002-2948-9749"},"institutions":[{"id":"https://openalex.org/I2614128279","display_name":"Dalle Molle Institute for Artificial Intelligence Research","ror":"https://ror.org/013355g38","country_code":"CH","type":"facility","lineage":["https://openalex.org/I15196421","https://openalex.org/I2614128279","https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Monaldo Mastrolilli","raw_affiliation_strings":["IDSIA, 6928, Manno, Switzerland"],"affiliations":[{"raw_affiliation_string":"IDSIA, 6928, Manno, Switzerland","institution_ids":["https://openalex.org/I2614128279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089622908"],"corresponding_institution_ids":["https://openalex.org/I2614128279"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.0991,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.90556073,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"853","last_page":"864"},"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.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8308560848236084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6873633861541748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6143531203269958},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5535573959350586},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.47367578744888306},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4687018096446991},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46281588077545166},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4298710823059082},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4262136220932007},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.42327386140823364},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.41270536184310913},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.279252290725708},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19123634696006775}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8308560848236084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6873633861541748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6143531203269958},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5535573959350586},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.47367578744888306},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4687018096446991},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46281588077545166},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4298710823059082},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4262136220932007},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.42327386140823364},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.41270536184310913},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.279252290725708},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19123634696006775},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-48350-3_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_71","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W91728630","https://openalex.org/W129224317","https://openalex.org/W1537010428","https://openalex.org/W1550811836","https://openalex.org/W1909205607","https://openalex.org/W1933011002","https://openalex.org/W1967344706","https://openalex.org/W1984628625","https://openalex.org/W2002025272","https://openalex.org/W2010484711","https://openalex.org/W2012805418","https://openalex.org/W2022749269","https://openalex.org/W2028085501","https://openalex.org/W2033515640","https://openalex.org/W2049087128","https://openalex.org/W2064366623","https://openalex.org/W2077397558","https://openalex.org/W2107052785","https://openalex.org/W2110180651","https://openalex.org/W2133404041","https://openalex.org/W2148012376","https://openalex.org/W2171261418","https://openalex.org/W2258079515","https://openalex.org/W2401610261","https://openalex.org/W2950706437","https://openalex.org/W2951661752","https://openalex.org/W2951914620"],"related_works":["https://openalex.org/W3037452003","https://openalex.org/W4296603869","https://openalex.org/W2395976569","https://openalex.org/W4302287671","https://openalex.org/W2885427910","https://openalex.org/W2949505842","https://openalex.org/W3115255814","https://openalex.org/W1480006018","https://openalex.org/W2951496501","https://openalex.org/W2324066812"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}