{"id":"https://openalex.org/W4403199802","doi":"https://doi.org/10.53015/23049235_2024_1_30","title":"INTEGER OPTIMIZATION PROBLEM","display_name":"INTEGER OPTIMIZATION PROBLEM","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4403199802","doi":"https://doi.org/10.53015/23049235_2024_1_30"},"language":"en","primary_location":{"id":"doi:10.53015/23049235_2024_1_30","doi":"https://doi.org/10.53015/23049235_2024_1_30","is_oa":true,"landing_page_url":"https://doi.org/10.53015/23049235_2024_1_30","pdf_url":"https://doi.org/10.53015/23049235_2024_1_30","source":{"id":"https://openalex.org/S4210230806","display_name":"Vestnik LSTU","issn_l":"2304-9235","issn":["2304-9235","3034-3275"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Vestnik LSTU","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.53015/23049235_2024_1_30","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109796842","display_name":"A.I. BOBYLEV","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A.I. BOBYLEV","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109796842"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":"1","first_page":"30","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9937000274658203,"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.9937000274658203,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.004699999932199717,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0006000000284984708,"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/integer-programming","display_name":"integer programming","score":0.9210000038146973},{"id":"https://openalex.org/keywords/transportation-challenges","display_name":"transport problems","score":0.8109999895095825},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9990000128746033},{"id":"https://openalex.org/keywords/linear-programming-algorithms","display_name":"linear programming algorithms","score":0.8090000152587891},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.75},{"id":"https://openalex.org/keywords/microsoft-excel","display_name":"Microsoft Excel","score":0.45100000500679016}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5511960387229919},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4792066514492035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4731113612651825},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4331144392490387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34250473976135254},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3261951506137848},{"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.53015/23049235_2024_1_30","doi":"https://doi.org/10.53015/23049235_2024_1_30","is_oa":true,"landing_page_url":"https://doi.org/10.53015/23049235_2024_1_30","pdf_url":"https://doi.org/10.53015/23049235_2024_1_30","source":{"id":"https://openalex.org/S4210230806","display_name":"Vestnik LSTU","issn_l":"2304-9235","issn":["2304-9235","3034-3275"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Vestnik LSTU","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.53015/23049235_2024_1_30","doi":"https://doi.org/10.53015/23049235_2024_1_30","is_oa":true,"landing_page_url":"https://doi.org/10.53015/23049235_2024_1_30","pdf_url":"https://doi.org/10.53015/23049235_2024_1_30","source":{"id":"https://openalex.org/S4210230806","display_name":"Vestnik LSTU","issn_l":"2304-9235","issn":["2304-9235","3034-3275"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Vestnik LSTU","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403199802.pdf","grobid_xml":"https://content.openalex.org/works/W4403199802.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W41132256","https://openalex.org/W7215536108","https://openalex.org/W313296872","https://openalex.org/W2541278419","https://openalex.org/W7126295553","https://openalex.org/W50345188","https://openalex.org/W2956960710","https://openalex.org/W3013291415","https://openalex.org/W7162306964","https://openalex.org/W1992428442"],"abstract_inverted_index":{"Mathematical":[0],"programming":[1,27,33,62],"is":[2,28],"a":[3],"mathematical":[4,23,32],"discipline":[5],"that":[6],"studies":[7],"various":[8],"extremal":[9],"problems":[10,19,34,48],"and":[11,59,76,83,102,111,126,143],"develops":[12],"algorithms":[13,90,98,112],"for":[14,30,64,91],"solving":[15,31,65,135],"them.":[16],"Among":[17],"the":[18,41,50,56,67,71,77,85,88,107,114,121,127,136],"are":[20,130,141],"those":[21],"of":[22,40,69,73,87,113,119,123,134],"integer":[24,45],"programming.":[25],"Integer":[26],"indispensable":[29],"in":[35],"which":[36],"some":[37],"or":[38],"all":[39],"variables":[42],"take":[43],"on":[44],"values.":[46],"The":[47,53,80,104,117,132],"include":[49],"transport":[51,57,93],"problem.":[52],"paper":[54,81,105],"considers":[55],"problem":[58,137],"three":[60,89],"linear":[61,96],"methods":[63,115,140],"it:":[66],"method":[68,72,118,122,129],"potentials,":[70,120],"differential":[74,124],"rents":[75,125],"simplex":[78,128],"method.":[79],"analyzes":[82],"assesses":[84],"effectiveness":[86],"optimizing":[92],"problems.":[94],"Several":[95],"optimization":[97],"have":[99],"been":[100],"studied":[101],"presented.":[103],"contains":[106],"basic":[108],"concepts,":[109],"formulas,":[110],"used.":[116],"considered.":[131],"results":[133],"using":[138,149],"these":[139],"presented":[142],"compared.":[144],"All":[145],"calculations":[146],"were":[147],"performed":[148],"Excel.":[150]},"counts_by_year":[],"updated_date":"2026-10-26T11:51:55.731654","created_date":"2024-10-08T00:00:00"}