{"id":"https://openalex.org/W2087132321","doi":"https://doi.org/10.1016/s0305-0548(98)00101-4","title":"An interior point method in Dantzig\u2013Wolfe decomposition","display_name":"An interior point method in Dantzig\u2013Wolfe decomposition","publication_year":1999,"publication_date":"1999-10-01","ids":{"openalex":"https://openalex.org/W2087132321","doi":"https://doi.org/10.1016/s0305-0548(98)00101-4","mag":"2087132321"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(98)00101-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00101-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & 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/A5044021552","display_name":"Ruben Kirkeby Martinson","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ruben Kirkeby Martinson","raw_affiliation_strings":["Department of Operations Research, Institute for Mathematical Sciences, University of Copenhagen, DK-2100 Copenhagen \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Institute for Mathematical Sciences, University of Copenhagen, DK-2100 Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109486816","display_name":"J\u00f8rgen Tind","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"J\u00f8rgen Tind","raw_affiliation_strings":["Department of Operations Research, Institute for Mathematical Sciences, University of Copenhagen, DK-2100 Copenhagen \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, Institute for Mathematical Sciences, University of Copenhagen, DK-2100 Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109486816"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.5037,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.68366534,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"12","first_page":"1195","last_page":"1216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9930999875068665,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9930999875068665,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.987500011920929,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.7754734754562378},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6330093145370483},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5619029998779297},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.541414737701416},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.5365253686904907},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.528886079788208},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5124495625495911},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5063248872756958},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4867665767669678},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4609963893890381},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4189717769622803},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4148171544075012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3384048044681549},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3161160349845886},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11300686001777649},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08619186282157898}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.7754734754562378},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6330093145370483},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5619029998779297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.541414737701416},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.5365253686904907},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.528886079788208},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5124495625495911},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5063248872756958},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4867665767669678},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4609963893890381},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4189717769622803},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4148171544075012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3384048044681549},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3161160349845886},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11300686001777649},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08619186282157898},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(98)00101-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(98)00101-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1533868172","https://openalex.org/W1985743726","https://openalex.org/W2057327943","https://openalex.org/W2790584719","https://openalex.org/W1595212828","https://openalex.org/W2139898805","https://openalex.org/W2007502743","https://openalex.org/W1583363919","https://openalex.org/W2043006884","https://openalex.org/W2564641171"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}