{"id":"https://openalex.org/W261597516","doi":null,"title":"The Cross-Section Method: An Algorithm for Linear Programming","display_name":"The Cross-Section Method: An Algorithm for Linear Programming","alternate_titles":[],"publication_year":1958,"publication_date":"1958-01-01","ids":{"openalex":"https://openalex.org/W261597516","mag":"261597516"},"language":"en","primary_location":{"id":"mag:261597516","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0607025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W261597516"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5073251686","display_name":"Jeremy J Stone","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Jeremy J Stone","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5073251686"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.5479000210762024,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.5479000210762024,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.33809998631477356,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10660000145435333,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/cross-section-method","display_name":"cross-section method","score":0.9829999804496765},{"id":"https://openalex.org/keywords/linear-programming-algorithms","display_name":"linear programming algorithms","score":0.8610000014305115},{"id":"https://openalex.org/keywords/subproblem-solving","display_name":"subproblem solving","score":0.6269999742507935},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.7170000076293945},{"id":"https://openalex.org/keywords/dual-simplex-method","display_name":"dual simplex method","score":0.9160000085830688}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8185592889785767},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7278430461883545},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6464423537254333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.612953782081604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5841516256332397},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5128379464149475},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4759923219680786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45317038893699646},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.45124244689941406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4095277190208435},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.39503252506256104},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.13113391399383545},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:261597516","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0607025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2288835437","https://openalex.org/W2033447412","https://openalex.org/W2325723974","https://openalex.org/W7095985198","https://openalex.org/W2132168913","https://openalex.org/W203847691","https://openalex.org/W614674535","https://openalex.org/W4235117706","https://openalex.org/W2117350831","https://openalex.org/W1601075758"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"an":[3,88],"algorithm":[4,14,38,84],"is":[5,74],"presented":[6],"which":[7,65,95],"solves":[8],"the":[9,16,28,63,78,98],"linear":[10],"programming":[11],"problem.":[12],"This":[13],"combines":[15],"usual":[17],"phase":[18,23],"one":[19,58,90],"(getting":[20,25],"feasibility)":[21],"and":[22,50,91],"two":[24],"optimality)":[26],"of":[27],"Simplex":[29],"or":[30,46,56,81],"Dual":[31],"methods":[32],"into":[33],"a":[34,42,47,60],"single":[35,43],"phase.":[36],"The":[37,71,83],"begins":[39],"with":[40],"either":[41,54],"activity":[44,80],"(column)":[45],"constraint":[48],"(equation)":[49],"proceeds":[51],"to":[52,86],"add":[53],"activities":[55],"constraints":[57],"at":[59],"time,":[61],"solving":[62],"subproblems":[64],"arise":[66,96],"for":[67],"their":[68],"optimal":[69],"solutions.":[70],"final":[72],"solution":[73],"attained":[75],"after":[76],"adding":[77],"last":[79],"constraint.":[82],"promises":[85],"be":[87],"efficient":[89],"has":[92],"several":[93],"advantages":[94],"from":[97],"information":[99],"supplied":[100],"about":[101],"subproblems.":[102],"(Author)":[103]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W261597516","counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
