{"id":"https://openalex.org/W2495969191","doi":null,"title":"Combining optimization and constraint programming by logic-based methods","display_name":"Combining optimization and constraint programming by logic-based methods","alternate_titles":[],"publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2495969191","mag":"2495969191"},"language":"en","primary_location":{"id":"mag:2495969191","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=936965","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/W2495969191"],"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/A5103247620","display_name":"Hak-Jin Kim","orcid":"https://orcid.org/0000-0001-6151-2446","observed_orcids":["https://orcid.org/0000-0001-6151-2446"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Hak-Jin Kim","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6151-2446","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5059159928","display_name":"John Hooker","orcid":"https://orcid.org/0000-0003-3169-1871","observed_orcids":["https://orcid.org/0000-0003-3169-1871"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"John Hooker","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3169-1871","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"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":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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9868000149726868,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9868000149726868,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.005499999970197678,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.001500000013038516,"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/constraint-programming","display_name":"constraint programming","score":0.9610000252723694},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.968999981880188},{"id":"https://openalex.org/keywords/declarative-modeling","display_name":"declarative modeling","score":0.5929999947547913},{"id":"https://openalex.org/keywords/constraint-propagation","display_name":"constraint propagation","score":0.8029999732971191},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.8209999799728394},{"id":"https://openalex.org/keywords/hybrid-optimization","display_name":"hybrid optimization","score":0.609000027179718}],"concepts":[{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.9173915386199951},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.8188399076461792},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.7740382552146912},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7460907697677612},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.6982856392860413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6011918783187866},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5614224076271057},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.55323326587677},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.4978041648864746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47651612758636475},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4423530101776123},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.4316801130771637},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4221784472465515},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4168068468570709},{"id":"https://openalex.org/C119489759","wikidata":"https://www.wikidata.org/wiki/Q5508843","display_name":"Functional reactive programming","level":5,"score":0.4128708839416504},{"id":"https://openalex.org/C119263510","wikidata":"https://www.wikidata.org/wiki/Q7248501","display_name":"Programming domain","level":4,"score":0.41027510166168213},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3897402286529541},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3596915602684021},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32002243399620056},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.28514623641967773},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25068432092666626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24643203616142273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1819612979888916},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2495969191","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=936965","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/W2072344787","https://openalex.org/W2780406577","https://openalex.org/W7217484603","https://openalex.org/W1563600186","https://openalex.org/W7095147169","https://openalex.org/W1607393599","https://openalex.org/W2004889994","https://openalex.org/W1481170590","https://openalex.org/W2038549215","https://openalex.org/W2967044339"],"abstract_inverted_index":{"It":[0],"has":[1,26,36,57,70,99],"been":[2,125],"considered":[3,126],"for":[4],"a":[5,52,88,102,128,204,233,260,275],"long":[6],"time":[7],"that":[8,34,152,210],"combinatorial":[9,78],"optimization":[10,79,144,156,172,227,240],"problems":[11,80,132],"should":[12],"be":[13],"solved":[14,133],"with":[15,43],"techniques":[16,137,238,252],"in":[17,39,93,112,140,176,197,222],"operations":[18,107,146],"research.":[19,147],"In":[20],"the":[21,44,141,212,223,237,263,268,280,286],"past":[22],"decade,":[23],"computer":[24,47],"science":[25],"advanced":[27],"at":[28],"such":[29],"an":[30],"eye":[31],"dazzling":[32],"speed":[33],"it":[35,109],"changed":[37],"industry":[38,83],"many":[40,113],"ways.":[41],"Along":[42],"progress":[45],"of":[46,54,64,77,91,143,145,184,188,199,226,253,278],"science,":[48],"constraint":[49,65,68,97,135,153,174,229,242,254],"programming,":[50],"as":[51,115,127],"subfield":[53],"artificial":[55],"intelligence,":[56],"grown":[58,100],"from":[59,82,101,106,239],"logic":[60],"programming":[61,69,98,121,136,154,175,230,258],"and":[62,117,155,166,173,228,231,241,256],"theory":[63],"satisfaction.":[66],"Recently":[67],"proved":[71],"its":[72],"strength":[73],"by":[74,134],"solving":[75],"classes":[76],"obtained":[81],"applications,":[84],"which":[85,191,218],"accordingly":[86],"provoked":[87],"new":[89,205,287],"area":[90],"research":[92],"OR/CS":[94],"interface.":[95],"Since":[96],"totally":[103],"different":[104],"background":[105],"research,":[108],"is":[110],"distinctive":[111],"aspects\u2014such":[114],"modeling":[116,208],"solution":[118,224],"methods.":[119],"Constraint":[120],"may":[122],"have":[123],"even":[124],"competing":[129,159],"paradigm":[130],"because":[131],"are":[138,157,196,220],"traditionally":[139],"domain":[142],"This":[148],"dissertation":[149],"will":[150,167],"show":[151],"not":[158],"but":[160],"rather":[161],"complementary":[162],"to":[163,170,179,235,249,273],"each":[164],"other":[165],"propose":[168],"how":[169,248,272],"combine":[171,250],"logic-based":[177],"methods":[178,225],"solve":[180,274],"problems.":[181],"\r\nThe":[182],"contents":[183],"this":[185],"book":[186],"consists":[187],"four":[189],"papers":[190],"were":[192],"previously":[193],"published":[194],"or":[195],"process":[198],"publication.":[200],"The":[201,215,244],"first":[202],"proposes":[203],"general":[206],"declarative":[207],"framework":[209],"combines":[211],"two":[213],"fields.":[214],"second":[216],"discusses":[217,247],"properties":[219],"common":[221],"suggests":[232],"scheme":[234],"integrate":[236],"programming.":[243,266],"third":[245],"paper":[246,270],"tightly":[251],"propagation":[255],"linear":[257],"into":[259],"specific":[261,276],"integration,":[262],"mixed":[264],"logic/linear":[265],"Finally,":[267],"last":[269],"describes":[271],"class":[277],"problems,":[279],"fixed-charge":[281],"network":[282],"flow":[283],"problem,":[284],"under":[285],"hybrid":[288],"approach.":[289]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2495969191","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-08-23T00:00:00"}
