{"id":"https://openalex.org/W2036826174","doi":"https://doi.org/10.1007/s10107-012-0520-4","title":"Stochastic binary problems with simple penalties for capacity constraints violations","display_name":"Stochastic binary problems with simple penalties for capacity constraints violations","publication_year":2012,"publication_date":"2012-03-10","ids":{"openalex":"https://openalex.org/W2036826174","doi":"https://doi.org/10.1007/s10107-012-0520-4","mag":"2036826174"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-012-0520-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-012-0520-4","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":true,"oa_status":"green","oa_url":"https://hal.science/hal-01255254v1/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083129489","display_name":"Bernard Fortz","orcid":"https://orcid.org/0000-0002-2355-8926"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"B. Fortz","raw_affiliation_strings":["Department of Computer Science, Facult\u00e9 des Sciences, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","Universit\u00e9 libre de Bruxelles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Facult\u00e9 des Sciences, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027133846","display_name":"Martine Labb\u00e9","orcid":"https://orcid.org/0000-0001-7471-2308"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"M. Labb\u00e9","raw_affiliation_strings":["Department of Computer Science, Facult\u00e9 des Sciences, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","Universit\u00e9 libre de Bruxelles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Facult\u00e9 des Sciences, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]},{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043303362","display_name":"Fran\u00e7ois Louveaux","orcid":null},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"F. Louveaux","raw_affiliation_strings":["Department of Business Administration, University of Namur (FUNDP), Namur, Belgium","University of Namur (FUNDP)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Business Administration, University of Namur (FUNDP), Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]},{"raw_affiliation_string":"University of Namur (FUNDP)","institution_ids":["https://openalex.org/I149768937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087966660","display_name":"Micha\u00ebl Poss","orcid":"https://orcid.org/0000-0002-9145-2525"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"M. Poss","raw_affiliation_strings":["CMUC, Department of Mathematics, University of Coimbra, 3001-454, Coimbra, Portugal","University of Coimbra#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CMUC, Department of Mathematics, University of Coimbra, 3001-454, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]},{"raw_affiliation_string":"University of Coimbra#TAB#","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087966660"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.1171,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.79872507,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"138","issue":"1-2","first_page":"199","last_page":"221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987000226974487,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9641233682632446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8127838969230652},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7224708199501038},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6411705017089844},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"Subset sum problem","score":0.6262540817260742},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5942031741142273},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5856733322143555},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5420504808425903},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5366591215133667},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.5308329463005066},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5264335870742798},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5228869318962097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4963849186897278},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4539983868598938},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4441670775413513},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4299524128437042},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3680642545223236},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35350361466407776},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.310275673866272},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12355616688728333},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11671778559684753}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9641233682632446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8127838969230652},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7224708199501038},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6411705017089844},{"id":"https://openalex.org/C109275537","wikidata":"https://www.wikidata.org/wiki/Q1154420","display_name":"Subset sum problem","level":3,"score":0.6262540817260742},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5942031741142273},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5856733322143555},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5420504808425903},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5366591215133667},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.5308329463005066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5264335870742798},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5228869318962097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4963849186897278},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4539983868598938},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4441670775413513},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4299524128437042},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3680642545223236},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35350361466407776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.310275673866272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12355616688728333},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11671778559684753},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s10107-012-0520-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-012-0520-4","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"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/c26bc003-ac43-4c0c-a606-ce25b910ea5b","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/c26bc003-ac43-4c0c-a606-ce25b910ea5b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fortz, B, Labb\u00e9, M, Louveaux, F & Poss, M 2013, 'Stochastic binary problems with simple penalties for capacity constraints violations', Mathematical Programming, vol. 138, no. 1-2, pp. 199-221. https://doi.org/10.1007/s10107-012-0520-4","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-01255254v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01255254","pdf_url":"https://hal.science/hal-01255254v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 2013, 138 (1-2), pp.199-221. ⟨10.1007/s10107-012-0520-4⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/318178","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/318178","pdf_url":"https://orbi.uliege.be/bitstream/2268/318178/1/KnapsackForLabLouvPossMathProg-rev.pdf","source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 138 (1-2), 199-221 (2013)","raw_type":"http://purl.org/coar/resource_type/c_6501"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/145393","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/145393","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical programming, 138 (1-2","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01255254v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01255254","pdf_url":"https://hal.science/hal-01255254v1/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 2013, 138 (1-2), pp.199-221. ⟨10.1007/s10107-012-0520-4⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7300000190734863}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334840","display_name":"Fonds pour la Formation \u00e0 la Recherche dans l\u2019Industrie et dans l\u2019Agriculture","ror":"https://ror.org/03q83t159"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2036826174.pdf","grobid_xml":"https://content.openalex.org/works/W2036826174.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1533721588","https://openalex.org/W1569990960","https://openalex.org/W1918578756","https://openalex.org/W1974203305","https://openalex.org/W1977604208","https://openalex.org/W1978264569","https://openalex.org/W1983916623","https://openalex.org/W1992464885","https://openalex.org/W2008276232","https://openalex.org/W2018100380","https://openalex.org/W2027111774","https://openalex.org/W2050997304","https://openalex.org/W2051267154","https://openalex.org/W2058409291","https://openalex.org/W2066875914","https://openalex.org/W2078783008","https://openalex.org/W2105036855","https://openalex.org/W2105972067","https://openalex.org/W2108203093","https://openalex.org/W2124515075","https://openalex.org/W2127331687","https://openalex.org/W2133997119","https://openalex.org/W2156293131","https://openalex.org/W2165355715","https://openalex.org/W2167723074","https://openalex.org/W2170213261","https://openalex.org/W2171830873","https://openalex.org/W2291444302","https://openalex.org/W2736278702","https://openalex.org/W2798344481","https://openalex.org/W3106992008"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W4249611560","https://openalex.org/W2005493932","https://openalex.org/W2087209118","https://openalex.org/W2993365626","https://openalex.org/W3169691842","https://openalex.org/W2352476958","https://openalex.org/W2076844787","https://openalex.org/W2041673501"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}