{"personrec":{"StatusID":1,"PersStatus":null,"Status":"Valid","PersID":31387,"PersName":"De Causmaecker, Patrick","PublicFlag":1,"CheckedFlag":0,"Surname":"De Causmaecker","Firstname":"Patrick","Initials":"P.","AddressedAs":null,"Function":null,"DateLastModified":{"date":"2023-05-02 10:08:18.393000","timezone_type":1,"timezone":"+00:00"},"PersTitle":null,"PersStatusID":null,"AbstractEnglish":null,"AbstractOtherLang":null,"AbstractLangCode":null,"AbstractLangID":null,"AutID":196281,"ND":"2015-06-05","UD":"2015-06-05"},"loaninfo":null,"pictures":[],"institutes":[{"instituterec":{"OrderNr":1,"Acronym":null,"ENFunction":null,"InsIDtmp":4671,"OrigNameLangCode":"en","OrigNameLangID":15,"FullOrigName":"University of Leuven; Department of Computer Science","InsID":4671,"Function":null,"BeginDay":null,"BeginMonth":null,"BeginYear":null,"Begindate":"","Enddate":"","PIAdrID":null,"AdrID":130317,"Line1":"Celestijnenlaan 200A","Line2":"3001 Heverlee","Line3":null,"Line4":null,"Phone":"+32-(0)16-32 77 00","GSM":null,"Email":null,"EnvName":"Belgium","EncAddress":"Celestijnenlaan 200A, 3001 Heverlee, Belgium","FullStandardName":"Katholieke Universiteit Leuven; Departement Computerwetenschappen","DirectorFlag":null,"MarineSciFlag":null,"SpecializedFlag":null},"parent":null,"institutes":null,"references":null,"conferences":null,"datasets":null,"persons":null,"pastpers":null,"subpers":null,"projects":null,"urls":null,"pictures":null,"published":null,"affrefs":null,"collections":null,"thesterms":null,"taxterms":null,"geoterms":null,"thestermsFRIS":null,"nXtins":null,"previns":null,"spcols":null,"resmessage":"no id specified","complete":0,"participantrec":null,"peerrevs":null,"urlmaps":null}],"pastins":[],"projects":[],"datasets":null,"references":{"A1":[{"BRefID":295834,"RR":"<b>Verstichel, J.; Kinable, J.; De Causmaecker, P.; Vanden Berghe, G.</b> (2015). A Combinatorial Benders' decomposition for the lock scheduling problem. <i>Computers & Operations Research 54</i>: 117-128. <a href=\"https://dx.doi.org/10.1016/j.cor.2014.09.007\" target=\"_blank\">https://dx.doi.org/10.1016/j.cor.2014.09.007</a>","AutID":332789,"MonDate":null,"AnaDate":2015,"PeerRev":1,"outputType":"1_A1","OpenAcc":0},{"BRefID":247015,"RR":"<b>Verstichel, J.; De Causmaecker, P.; Spieksma, F.; Vanden Berghe, G.</b> (2014). The generalized lock scheduling problem: an exact approach. <i>Transp. Res., Part E Logist. Trans. Rev. 65</i>: 16-34. <a href=\"http://dx.doi.org/10.1016/j.tre.2013.12.010\" target=\"_blank\">dx.doi.org/10.1016/j.tre.2013.12.010</a>","AutID":196281,"MonDate":null,"AnaDate":2014,"PeerRev":1,"outputType":"1_A1","OpenAcc":0},{"BRefID":257236,"RR":"<b>Verstichel, J.; De Causmaecker, P.; Spieksma, F.; Vanden Berghe, G.</b> (2014). Exact and heuristic methods for placing ships in locks. <i>Eur. J. Oper. Res. 235(2)</i>: 387-398. <a href=\"https://dx.doi.org/10.1016/j.ejor.2013.06.045\" target=\"_blank\">https://dx.doi.org/10.1016/j.ejor.2013.06.045</a>","AutID":223078,"MonDate":null,"AnaDate":2014,"PeerRev":1,"outputType":"1_A1","OpenAcc":0}],"PeerRevRef":[{"BRefID":296060,"RR":"<b>Verstichel, J.; De Causmaecker, P.; Vanden Berghe, G.</b> (2011). Scheduling algorithms for the lock scheduling problem. <i>Procedia. Social and Behavioral Sciences 20</i>: 806-815. <a href=\"https://dx.doi.org/10.1016/j.sbspro.2011.08.089\" target=\"_blank\">https://dx.doi.org/10.1016/j.sbspro.2011.08.089</a>","AutID":327404,"MonDate":null,"AnaDate":2011,"PeerRev":1,"outputType":"2_PeerRevRef","OpenAcc":1}]},"urls":null,"spcols":null,"thesterms":null,"taxterms":null,"pub":1,"newses":{"SesID":76070,"LoginName":"VLIZ2000\\zohrab","LoginID":435,"DD":"2015-06-05"},"updses":{"SesID":76070,"LoginName":"VLIZ2000\\zohrab","LoginID":435,"DD":"2015-06-05"},"urlmaps":[],"resmessage":"no id specified","complete":1}