{"id":"https://openalex.org/W1971978410","doi":"https://doi.org/10.1007/bf02099703","title":"An algorithm for large scale 0\u20131 integer programming with application to airline crew scheduling","display_name":"An algorithm for large scale 0\u20131 integer programming with application to airline crew scheduling","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W1971978410","doi":"https://doi.org/10.1007/bf02099703","mag":"1971978410"},"language":"en","primary_location":{"id":"doi:10.1007/bf02099703","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02099703","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},"type":"article","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/A5063127621","display_name":"Dag Wedelin","orcid":null},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Dag Wedelin","raw_affiliation_strings":["Department of Computing Science, Chalmers University of Technology, G\u00f6teborg, S-412 96, G\u00f6teborg, Sweden","Department of Computing Science, Chalmers University of Technology, G\u00f6teborg, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology, G\u00f6teborg, S-412 96, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Department of Computing Science, Chalmers University of Technology, G\u00f6teborg, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063127621"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":23.5426,"has_fulltext":false,"cited_by_count":165,"citation_normalized_percentile":{"value":0.99669799,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"1","first_page":"283","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"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/theory-of-computation","display_name":"Theory of computation","score":0.7394492030143738},{"id":"https://openalex.org/keywords/crew-scheduling","display_name":"Crew scheduling","score":0.6777542233467102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6300453543663025},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6106668710708618},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5970052480697632},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5917080044746399},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5275242924690247},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5031208395957947},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48416048288345337},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4661615490913391},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46417686343193054},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.44806092977523804},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43842217326164246},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43208587169647217},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41488081216812134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4115177392959595}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7394492030143738},{"id":"https://openalex.org/C2776986690","wikidata":"https://www.wikidata.org/wiki/Q1139830","display_name":"Crew scheduling","level":3,"score":0.6777542233467102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6300453543663025},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6106668710708618},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5970052480697632},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5917080044746399},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5275242924690247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5031208395957947},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48416048288345337},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4661615490913391},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46417686343193054},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.44806092977523804},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43842217326164246},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43208587169647217},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41488081216812134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4115177392959595},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf02099703","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02099703","pdf_url":null,"source":{"id":"https://openalex.org/S57667410","display_name":"Annals of Operations Research","issn_l":"0254-5330","issn":["0254-5330","1572-9338"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.3943","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.3943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/ComputingScience/Research/Algorithms/papers/opt_journal.ps","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":17,"referenced_works":["https://openalex.org/W187359699","https://openalex.org/W1551635709","https://openalex.org/W1573881838","https://openalex.org/W1608080587","https://openalex.org/W1963547452","https://openalex.org/W1976403569","https://openalex.org/W2011039300","https://openalex.org/W2028438572","https://openalex.org/W2059225841","https://openalex.org/W2071887553","https://openalex.org/W2074295547","https://openalex.org/W2077724649","https://openalex.org/W2106924148","https://openalex.org/W2157054705","https://openalex.org/W2505968561","https://openalex.org/W2587612458","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1550117727","https://openalex.org/W2170003709","https://openalex.org/W3095810947","https://openalex.org/W2202486749","https://openalex.org/W2147086810","https://openalex.org/W2026075918","https://openalex.org/W41005574","https://openalex.org/W1594413663","https://openalex.org/W2019216770","https://openalex.org/W2885427910"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}