{"id":"https://openalex.org/W2042487200","doi":"https://doi.org/10.1007/s10107-002-0300-7","title":"Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem","display_name":"Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem","publication_year":2002,"publication_date":"2002-12-01","ids":{"openalex":"https://openalex.org/W2042487200","doi":"https://doi.org/10.1007/s10107-002-0300-7","mag":"2042487200"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-002-0300-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-002-0300-7","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/A5011840668","display_name":"Fran\u00e7ois Vanderbeck","orcid":"https://orcid.org/0000-0001-5791-7053"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Francois Vanderbeck","raw_affiliation_strings":["Math\u00e9matiques Appliqu\u00e9es Bordeaux (MAB), Universit\u00e9 Bordeaux 1, 351 Cours de la Lib\u00e9ration, F-33405 Talence Cedex, France. Fax: +33 (05) 57 96 21 23. e-mail: fv@math.u-bordeaux.fr Url: http://www.math.u-bordeaux.fr/\u223cfv, , , , , , FR","Math\u00e9matiques Appliqu\u00e9es Bordeaux (MAB), Universit\u00e9 Bordeaux 1, 351 Cours de la Lib\u00e9ration, F-33405 Talence Cedex, France. Fax: +33 (05) 57 96 21 23. e-mail: fv@math.u-bordeaux.fr Url: http://www.math.u-bordeaux.fr/\u223cfv, FR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Math\u00e9matiques Appliqu\u00e9es Bordeaux (MAB), Universit\u00e9 Bordeaux 1, 351 Cours de la Lib\u00e9ration, F-33405 Talence Cedex, France. Fax: +33 (05) 57 96 21 23. e-mail: fv@math.u-bordeaux.fr Url: http://www.math.u-bordeaux.fr/\u223cfv, , , , , , FR","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Math\u00e9matiques Appliqu\u00e9es Bordeaux (MAB), Universit\u00e9 Bordeaux 1, 351 Cours de la Lib\u00e9ration, F-33405 Talence Cedex, France. Fax: +33 (05) 57 96 21 23. e-mail: fv@math.u-bordeaux.fr Url: http://www.math.u-bordeaux.fr/\u223cfv, FR","institution_ids":["https://openalex.org/I15057530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011840668"],"corresponding_institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.9311,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80770779,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"94","issue":"1","first_page":"125","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","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/T12176","display_name":"Optimization and Packing Problems","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.9973999857902527,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9962999820709229,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9085637331008911},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8211383819580078},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6939971446990967},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6754178404808044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.485371470451355},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4800894856452942},{"id":"https://openalex.org/keywords/numerical-analysis","display_name":"Numerical analysis","score":0.47840771079063416},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4674787223339081},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3565446734428406},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3233947157859802},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3208370804786682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12845832109451294},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11696475744247437},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09771907329559326},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.082864910364151}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9085637331008911},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8211383819580078},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6939971446990967},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6754178404808044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.485371470451355},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4800894856452942},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.47840771079063416},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4674787223339081},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3565446734428406},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3233947157859802},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3208370804786682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12845832109451294},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11696475744247437},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09771907329559326},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.082864910364151}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-002-0300-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-002-0300-7","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:HAL:inria-00342631v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00342631","pdf_url":null,"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, Series A, 2002, 94 (1), pp.125-136. ⟨10.1007/s10107-002-0300-7⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/116372","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/116372","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/191385","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/191385","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334630","display_name":"Economic and Social Research Council","ror":"https://ror.org/03n0ht308"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1975033706","https://openalex.org/W1992439238","https://openalex.org/W2017316844","https://openalex.org/W2060322444","https://openalex.org/W2066671865"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078","https://openalex.org/W3125085490"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}