{"id":"https://openalex.org/W2044065851","doi":"https://doi.org/10.1080/00207160008804975","title":"Dynamic variable ordering in graph based backjumping algorithms for csps","display_name":"Dynamic variable ordering in graph based backjumping algorithms for csps","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2044065851","doi":"https://doi.org/10.1080/00207160008804975","mag":"2044065851"},"language":"en","primary_location":{"id":"doi:10.1080/00207160008804975","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804975","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5101608029","display_name":"D. K. Gupta","orcid":"https://orcid.org/0009-0005-9776-7404"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"D.K. Gupta","raw_affiliation_strings":["\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India","Department of Mathematics, Indian Institute of Technology, Kharagpur 721302 India"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Mathematics, Indian Institute of Technology, Kharagpur 721302 India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101608029"],"corresponding_institution_ids":["https://openalex.org/I145894827"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19137708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"75","issue":"2","first_page":"167","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/backtracking","display_name":"Backtracking","score":0.8794340491294861},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7113224267959595},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5799334645271301},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5396928787231445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5151792764663696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5138171315193176},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.44738414883613586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3961138129234314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26166945695877075},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10078725218772888}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8794340491294861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7113224267959595},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5799334645271301},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5396928787231445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5151792764663696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5138171315193176},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.44738414883613586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3961138129234314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26166945695877075},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10078725218772888},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160008804975","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160008804975","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2751752","https://openalex.org/W1550402024","https://openalex.org/W1579369911","https://openalex.org/W1979622972","https://openalex.org/W1999038767","https://openalex.org/W2002478775","https://openalex.org/W2005234139","https://openalex.org/W2024182184","https://openalex.org/W2043829066","https://openalex.org/W2048257758","https://openalex.org/W2061734130","https://openalex.org/W2068852367","https://openalex.org/W2069683773","https://openalex.org/W2096138715","https://openalex.org/W2119456262","https://openalex.org/W2148546044","https://openalex.org/W2151720296","https://openalex.org/W2170826919","https://openalex.org/W2799004609","https://openalex.org/W4213214460","https://openalex.org/W4230870880"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W3014398131","https://openalex.org/W3122634451","https://openalex.org/W2997121997","https://openalex.org/W2188549339","https://openalex.org/W1576780029","https://openalex.org/W2101480270"],"abstract_inverted_index":{"Abstract":[0],"Constraint":[1],"Satisfaction":[2],"Problems":[3],"(CSPs)":[4],"belong":[5],"to":[6,99,105,283,288],"the":[7,28,51,71,75,81,95,100,108,112,123,133,139,166,196,207,210,216,260,269,285,291],"class":[8,29],"of":[9,30,47,53,78,122,125,135,153,188,198,204,234],"NP-Complete":[10],"problems.":[11,20],"Backtracking":[12],"algorithm":[13,61,96,113,137,262,287],"is":[14,23,39,120,259,275,281],"generally":[15],"used":[16],"for":[17,49,127,164],"solving":[18],"these":[19,235],"However,":[21,272],"it":[22,32,180],"not":[24],"very":[25],"useful":[26],"as":[27,150],"problems":[31,245,270],"can":[33],"solve":[34,289],"within":[35],"practical":[36],"resource":[37],"limits":[38],"small.":[40],"Researchers":[41],"have":[42,177,194],"developed":[43,225],"a":[44,87,91,162,183],"large":[45],"number":[46],"algorithms":[48,175,224,236],"enhancing":[50],"performance":[52,68,126,233],"backtracking":[54],"algorithm.":[55],"The":[56,221,231],"Graph":[57],"Based":[58],"Backjumping":[59],"(GBJ)":[60],"proposed":[62,132,161],"by":[63,69],"Dechter":[64],"[2]":[65],"improves":[66],"its":[67],"using":[70],"knowledge":[72],"extracted":[73],"from":[74,114],"graphical":[76],"representation":[77],"CSPs":[79,249],"called":[80],"constraint":[82],"graph.":[83,109],"That":[84],"is,":[85],"whenever":[86],"dead-end":[88],"occurs":[89],"at":[90],"particular":[92],"variable":[93,103,208,295],"X,":[94],"backs":[97],"up":[98],"most":[101],"recent":[102],"connected":[104],"X":[106],"in":[107,172,182,186,215,267,277],"This":[110],"avoids":[111],"performing":[115],"redundant":[116],"consistency":[117],"checks":[118],"which":[119],"one":[121],"measures":[124],"CSPs.":[128],"Prosser":[129],"[18]":[130],"has":[131,160],"hybrids":[134],"this":[136,191],"namely":[138],"Backmarking":[140],"with":[141,147,209,237],"GBJ":[142,148,264],"(BM-GBJ)":[143],"and":[144,176,229,238,246,265],"Forward":[145],"Checking":[146],"(FC-GBJ)":[149],"further":[151],"improvements":[152,185],"GBJ.":[154],"P.":[155],"V.":[156],"Run":[157],"[":[158],"2]":[159],"methodology":[163],"implementing":[165],"Dynamic":[167,199],"Variable":[168,200],"Ordering":[169,201],"(DVO)":[170,202],"[9,11]":[171],"tree":[173],"search":[174],"shown":[178],"that":[179,255],"results":[181,253],"significant":[184],"many":[187],"them.":[189],"In":[190],"paper,":[192],"we":[193],"investigated":[195],"implementation":[197],"heuristic":[203],"instantiating":[205],"next":[206],"Minimum":[211],"Remaining":[212],"Values":[213],"(MRV)":[214],"graph":[217],"based":[218],"backjumping":[219],"algorithms.":[220],"three":[222],"new":[223],"are":[226,250],"GBJvar,":[227],"BM-GBJvar":[228],"FC-GBJvar.":[230],"empirical":[232],"without":[239,256],"DVO":[240,274],"on":[241,247],"Zebra":[242],"problem,":[243],"TV-queens":[244],"random":[248],"tested.":[251,271],"Our":[252],"demonstrate":[254],"DVO,":[257],"BM-GBJ":[258],"best":[261,286],"than":[263],"FC-GBJ":[266],"all":[268,290],"when":[273],"implemented":[276],"them":[278],"then":[279],"FC-GBJvar":[280],"found":[282],"be":[284],"problem.":[292],"Keywords:":[293],"C.S.PNP-completeBackjumpingDynamic":[294],"orderingC.R.":[296],"Categories:":[297],"G2.2F2.2":[298],"\u2217":[299,301,304],"dkg@maths.iitkgp.ernet.in":[300,302,305],"Notes":[303]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}