{"id":"https://openalex.org/W2016815536","doi":"https://doi.org/10.1007/bf01593767","title":"Experiments in mixed-integer linear programming using pseudo-costs","display_name":"Experiments in mixed-integer linear programming using pseudo-costs","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2016815536","doi":"https://doi.org/10.1007/bf01593767","mag":"2016815536"},"language":"en","primary_location":{"id":"doi:10.1007/bf01593767","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593767","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5067779497","display_name":"J. M. Gauthier","orcid":null},"institutions":[{"id":"https://openalex.org/I4210112067","display_name":"IBM (France)","ror":"https://ror.org/02wnbr922","country_code":"FR","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210112067"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J. -M. Gauthier","raw_affiliation_strings":["Program Product Center, IBM-France, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Program Product Center, IBM-France, Paris, France","institution_ids":["https://openalex.org/I4210112067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082988818","display_name":"G. Ribi\u00e8re","orcid":null},"institutions":[{"id":"https://openalex.org/I4210112067","display_name":"IBM (France)","ror":"https://ror.org/02wnbr922","country_code":"FR","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210112067"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"G. Ribi\u00e8re","raw_affiliation_strings":["Program Product Center, IBM-France, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Program Product Center, IBM-France, Paris, France","institution_ids":["https://openalex.org/I4210112067"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":12.1375,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.98828283,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"26","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.8434554934501648},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.7228994965553284},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7207820415496826},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.6327148675918579},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6280392408370972},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5858080387115479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5199012160301208},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4623025953769684},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43527764081954956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2527797818183899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09375753998756409}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.8434554934501648},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7228994965553284},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7207820415496826},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6327148675918579},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6280392408370972},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5858080387115479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5199012160301208},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4623025953769684},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43527764081954956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2527797818183899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09375753998756409},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01593767","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593767","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W177736772","https://openalex.org/W1971809832","https://openalex.org/W1979154120","https://openalex.org/W1999049191","https://openalex.org/W2001876816","https://openalex.org/W2013327579","https://openalex.org/W2033735555","https://openalex.org/W2082574280","https://openalex.org/W2091364465","https://openalex.org/W2117470170","https://openalex.org/W2169666402","https://openalex.org/W4240374930"],"related_works":["https://openalex.org/W2769220156","https://openalex.org/W2009796757","https://openalex.org/W4210880521","https://openalex.org/W4302819359","https://openalex.org/W2941114593","https://openalex.org/W4252122881","https://openalex.org/W1971357083","https://openalex.org/W2941986668","https://openalex.org/W4232431455","https://openalex.org/W3116484972"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}