[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_bc04808e-265e-415f-ac01-cc14425d4973":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:bc04808e-265e-415f-ac01-cc14425d4973,\"}":99},{"code":4,"data":5,"meta":18},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":20,"manageAffiliations":45,"indexDatabases":57,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},"bc04808e-265e-415f-ac01-cc14425d4973","2023-12-05T05:46:38.315+00:00","2025-11-21T10:01:06.835+00:00",[],"Discrete-Optimization",{"issn":12,"title":14},{"VOID":13},"15725286",{"EN":15},"Discrete Optimization","PUBLISHER","PENDING",null,0,[21,29,37],{"id":22,"createTime":23,"updateTime":24,"relativeEntities":25,"label":26,"description":28,"parentId":18,"standard":18,"scholarHubFieldId":18},"ee33e266-088e-4829-aa2f-5ea59917dac0","2023-05-29T10:24:03.075+00:00","2023-11-21T08:08:48.024+00:00",[],{"EN":27},"Applied Mathematics",{},{"id":30,"createTime":31,"updateTime":32,"relativeEntities":33,"label":34,"description":36,"parentId":18,"standard":18,"scholarHubFieldId":18},"e8c4e2fa-b139-4154-a158-595bd93d381c","2023-05-29T10:24:07.692+00:00","2023-11-21T07:15:31.396+00:00",[],{"EN":35},"Computational Theory and Mathematics",{},{"id":38,"createTime":39,"updateTime":40,"relativeEntities":41,"label":42,"description":44,"parentId":18,"standard":18,"scholarHubFieldId":18},"cfe20487-5108-4c23-a284-2aedca5fb76d","2023-05-29T10:24:09.965+00:00","2023-11-21T05:15:17.277+00:00",[],{"EN":43},"Theoretical Computer Science",{},[46],{"id":47,"createTime":48,"updateTime":49,"relativeEntities":50,"slug":51,"properties":52,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":55,"url":18,"parentIds":56,"statistic":18},"c749757b-dddf-4e6f-9697-b9c441adc06c","2023-05-29T10:24:07.401+00:00","2025-11-21T10:06:14.206+00:00",[],"Elsevier",{"title":53},{"EN":51},"AFFILIATION",11,[],[58,79],{"id":59,"indexDatabase":60,"url":72,"indexYears":73,"academicFieldIds":74,"indexDatabaseRanking":78},"c003c4e7-8362-4ea1-bed4-b023f3383950",{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"label":65,"description":67,"key":69,"publicationTags":70,"standard":18},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":66,"VI":66},"Scopus - Elsevier",{"EN":66,"VI":68},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[71],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28469","2004-2025",[75,76,77],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","8f050cfc-6be8-4218-91ba-e890405f0438","f58e9119-c14c-473f-8a7c-5a035e4ab69a","SCOPUS__Q2",{"id":80,"indexDatabase":81,"url":95,"indexYears":18,"academicFieldIds":96,"indexDatabaseRanking":18},"9986ddc4-096f-4591-ae7c-b63156c5ac70",{"id":82,"createTime":83,"updateTime":84,"relativeEntities":85,"label":86,"description":88,"key":91,"publicationTags":92,"standard":18},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":87,"VI":87},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":89,"EN":90},"Cơ sở dữ liệu SCIE","SCIE database","scie",[93,94],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1572-5286",[97,98],"ef99e6f3-ace4-49a6-aa47-d5e24f7d2768","0a89cee9-2df6-4b14-8fcb-700fd0044c25",{"meta":100,"data":102},{"total":101},"290",[103,189,249,309,527,599,685,784,871,952],{"id":104,"createTime":105,"updateTime":106,"relativeEntities":107,"slug":108,"properties":109,"entityType":118,"verifyStatus":119,"verifyTime":120,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":122,"fullTextUrl":18,"authors":123,"publicationType":156,"publisherRelationship":157,"citationCount":18,"citationInfo":18,"publishDate":185,"publishYear":186,"citationAnalyzeStatus":187,"lastCitationAnalyze":106,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"e2dd340a-d3ff-4fc4-80b2-33afedd01170","2024-01-16T12:17:43.229+00:00","2025-12-19T23:53:55.380+00:00",[],"On-the-feedback-vertex-set-polytope-of-a-series-parallel-graph",{"references":110,"title":112,"doi":114,"gsPaper":116},{"VOID":111},"Reed, 2002, Algorithmic aspects of tree width, 85\nArnborg, 1991, Easy problems for tree-decomposable graphs, J. Algorithms, 12, 308, 10.1016\u002F0196-6774(91)90006-K\nCourcelle, 1990, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput., 85, 12, 10.1016\u002F0890-5401(90)90043-H\nSbihi, 1980, Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math., 29, 53, 10.1016\u002F0012-365X(90)90287-R\nLovász, 1986\nMinty, 1980, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory, 28, 284, 10.1016\u002F0095-8956(80)90074-X\nNakamura, 2001, A revision of Minty’s algorithm for finding a maximum weighted stable set of a claw-free graph, J. Oper. Res. Soc. Japan, 44, 194\nGalluccio, 1997, The rank facets of the stable set polytope for claw-free graphs, J. Combin. Theory Ser. B, 69, 1, 10.1006\u002Fjctb.1996.1715\nOriolo, 2003, Clique family inequalities for the stable set polytope of quasi-line graphs, Discrete Appl. Math., 132, 185, 10.1016\u002FS0166-218X(03)00400-1\nEisenbrand, 2005, Circular ones matrices and the stable set polytope of quasi-line graphs, vol. 3509, 291\nConforti, 2004, On the cut polyhedron, Discrete Math., 277, 279, 10.1016\u002Fj.disc.2002.12.001\nDing, 2002, Packing cycles in graphs, J. Combin. Theory Ser. B, 86, 381, 10.1006\u002Fjctb.2002.2134\nCunningham, 1978, A primal algorithm for optimum matching, Math. Program. Stud., 8, 50, 10.1007\u002FBFb0121194\nSchrijver, 2003, Combinatorial Optimization: Polyhedra and Efficiency, vol. 24\nSebö, 1988, The Schrijver system of odd join polyhedra, Combinatorica, 8, 103, 10.1007\u002FBF02122558\nGerards, 1989, A min–max relation for stable sets in graphs with no odd-K4, J. Combin. Theory Ser. B, 47, 330, 10.1016\u002F0095-8956(89)90032-4\nSewell, 1993, Stability critical graphs and even subdivisions of K4, J. Combin. Theory Ser. B, 59, 74, 10.1006\u002Fjctb.1993.1055\nSewell, 1995, Stability critical graphs and rank facets of the stable set polytope, Discrete Math., 147, 247, 10.1016\u002F0012-365X(94)00168-I\nFleiner, 1997, Covering a symmetric poset with symmetric chains, Combinatorica, 17, 339, 10.1007\u002FBF01215916\nSchrijver, 1986, Theory of linear and integer programming\nGoemans, 1994, The Steiner tree polytope and related polyhedra, Math. Program., 63, 157, 10.1007\u002FBF01582064\nMargot, 1994, Tree polytopes on 2-trees, Math. Program., 63, 183, 10.1007\u002FBF01582065\nBarahona, 1994, Compositions of graph and polyhedra I: balanced induced subgraphs and acyclic subgraphs, SIAM J. Discrete Math., 7, 344, 10.1137\u002FS0895480190182666\nGerards, 1986, Matrices with the Edmonds–Johnson property, Combinatorica, 6, 365, 10.1007\u002FBF02579262\nBrunetta, 2000, Solving the feedback vertex set problem on undirected graphs, Discrete Applied Mathematics, 101, 37, 10.1016\u002FS0166-218X(99)00180-8\nBafna, 1995, vol. 1004, 142\nChudak, 1998, A primal–dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett., 22, 111, 10.1016\u002FS0167-6377(98)00021-2",{"EN":113},"On the feedback vertex set polytope of a series–parallel graph",{"VOID":115},"10.1016\u002Fj.disopt.2009.01.004",{"VOID":117},"[]","PUBLICATION","VERIFIED","2024-05-09T14:14:21.081+00:00","Auto Verify","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS157252860900005X",[124,141],{"id":125,"sortIndex":126,"researcher":18,"roles":127,"affiliations":129,"properties":138},"05e64153-342a-411b-b08a-7646da34b8b1",1,[128],"AUTHOR",[130],{"id":18,"sortIndex":19,"affiliation":131,"properties":18},{"id":132,"createTime":133,"updateTime":133,"relativeEntities":134,"slug":18,"properties":135,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"e018a8a3-37f4-4cb9-a5e1-4ac745389b1e","2024-01-16T12:17:43.265+00:00",[],{"title":136},{"VI":137},"Université du Québec à Montréal and GERAD, HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7",{"title":139},{"VI":140},"Odile Marcotte",{"id":142,"sortIndex":19,"researcher":18,"roles":143,"affiliations":144,"properties":153},"a82f2a4d-6c94-4ff7-95b6-654ffb41100b",[128],[145],{"id":18,"sortIndex":19,"affiliation":146,"properties":18},{"id":147,"createTime":148,"updateTime":148,"relativeEntities":149,"slug":18,"properties":150,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"eaa1358b-6d79-42c0-95c6-980b987cfb7c","2024-01-16T12:17:43.254+00:00",[],{"title":151},{"VI":152},"Département de mathématiques, Université Libre de Bruxelles, CP 216, Boulevard du Triomphe, B-1050 Bruxelles, Belgique",{"title":154},{"VI":155},"Samuel Fiorini","ARTICLE",{"url":122,"publisher":158,"properties":180},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":159,"slug":10,"properties":160,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":163,"manageAffiliations":164,"indexDatabases":165,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":161,"title":162},{"VOID":13},{"EN":15},[],[],[166,173],{"id":59,"indexDatabase":167,"url":72,"indexYears":73,"academicFieldIds":172,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":168,"label":169,"description":170,"key":69,"publicationTags":171,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":174,"url":95,"indexYears":18,"academicFieldIds":179,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":175,"label":176,"description":177,"key":91,"publicationTags":178,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":181,"pages":183},{"VOID":182},"6",{"VOID":184},"271-287","2009-08-01",2009,"ERROR_IN_GET_PLATFORM_ID",false,{"id":190,"createTime":191,"updateTime":192,"relativeEntities":193,"slug":194,"properties":195,"entityType":118,"verifyStatus":119,"verifyTime":192,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":202,"fullTextUrl":18,"authors":203,"publicationType":156,"publisherRelationship":219,"citationCount":18,"citationInfo":18,"publishDate":247,"publishYear":248,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"7e7d2c6e-05e6-4f28-8c82-b90fb7f10dff","2024-01-14T19:29:05.364+00:00","2024-12-20T23:53:21.131+00:00",[],"Facets-for-node-capacitated-multicut-polytopes-from-path-block-cycles-with-two-common-nodes",{"references":196,"title":198,"doi":200},{"VOID":197},"Aardal, 1997, Polyhedral combinatorics\nNemhauser, 1988\nDe Souza, 1995, Some new classes of facets for the equicut polytope, Discrete Appl. Math., 62, 167, 10.1016\u002F0166-218X(94)00151-3\nFerreira, 1996, Formulations and valid inequalities for the node capacitated graph partitioning problem, Math. Program., 74, 247, 10.1007\u002FBF02592198\nGarey, 1979\nConforti, 1990, The equipartition polytope II: Valid inequalities and facets, Math. Program., 49, 71, 10.1007\u002FBF01588779\nSørensen, 2004, b-Tree facets for the simple graph partitioning polytope, J. Comb. Optim., 8, 151, 10.1023\u002FB:JOCO.0000031417.96218.26\nSørensen, 2007, Facet-defining inequalities for the simple graph partitioning polytope, Discrete Optim., 4, 221, 10.1016\u002Fj.disopt.2006.08.001\nFaigle, 1986, A cutting plane algorithm for optimal graph partitioning, Methods Oper. Res., 57, 109\nArmbruster, 2008, On the graph bisection cut polytope, SIAM J. Discrete Math., 22, 1073, 10.1137\u002F060675253\nHager, 2013, An exact algorithm for graph partitioning, Math. Program., 137, 531, 10.1007\u002Fs10107-011-0503-x\nConforti, 1990, The equipartition polytope I: Formulations, dimension and basic facets, Math. Program., 49, 49, 10.1007\u002FBF01588778\nLabbé, 2010, Size-constrained graph partitioning polytopes, Discrete Math., 310, 3473, 10.1016\u002Fj.disc.2010.08.009\nFerreira, 1998, The node capacitated graph partitioning problem: A computational study, Math. Program., 81, 229, 10.1007\u002FBF01581107",{"EN":199},"Facets for node-capacitated multicut polytopes from path-block cycles with two common nodes",{"VOID":201},"10.1016\u002Fj.disopt.2017.03.001","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528617300476",[204],{"id":205,"sortIndex":19,"researcher":18,"roles":206,"affiliations":207,"properties":216},"779f2d04-293f-4b89-bca8-97679234183a",[128],[208],{"id":18,"sortIndex":19,"affiliation":209,"properties":18},{"id":210,"createTime":211,"updateTime":211,"relativeEntities":212,"slug":18,"properties":213,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"9e0582b3-11f1-404b-822c-a5603c775fd2","2024-02-09T02:00:56.461+00:00",[],{"title":214},{"VI":215},"Department of Economics and Business Economics, Aarhus University, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark",{"title":217},{"VI":218},"Michael M. Sørensen",{"url":202,"publisher":220,"properties":242},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":221,"slug":10,"properties":222,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":225,"manageAffiliations":226,"indexDatabases":227,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":223,"title":224},{"VOID":13},{"EN":15},[],[],[228,235],{"id":59,"indexDatabase":229,"url":72,"indexYears":73,"academicFieldIds":234,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":230,"label":231,"description":232,"key":69,"publicationTags":233,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":236,"url":95,"indexYears":18,"academicFieldIds":241,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":237,"label":238,"description":239,"key":91,"publicationTags":240,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":243,"pages":245},{"VOID":244},"25",{"VOID":246},"120-140","2017-08-01",2017,{"id":250,"createTime":251,"updateTime":252,"relativeEntities":253,"slug":254,"properties":255,"entityType":118,"verifyStatus":119,"verifyTime":252,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":262,"fullTextUrl":18,"authors":263,"publicationType":156,"publisherRelationship":279,"citationCount":18,"citationInfo":18,"publishDate":307,"publishYear":308,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"6ee95f56-fa61-4959-a196-4c58d404ebc2","2023-12-12T19:25:23.139+00:00","2025-01-24T23:47:59.275+00:00",[],"A-note-on-approximation-of-a-ball-by-polytopes",{"references":256,"title":258,"doi":260},{"VOID":257},"Anstreicher, 1997, On Vaidya's volumetric cutting plane method for convex programming, Math. Oper. Res., 22, 63, 10.1287\u002Fmoor.22.1.63\nAnstreicher, 1999, Ellipsoidal approximation of convex sets based on the volumetric barrier, Math. Oper. Res., 24, 193, 10.1287\u002Fmoor.24.1.193\nK.M. Anstreicher, Personal communication.\nBall, 1990, Convex bodies with few faces, Proc. Amer. Math. Soc., 110, 225, 10.1090\u002FS0002-9939-1990-1019270-8\nBárány, 1987, Computing the volume is difficult, Discrete Comput. Geom., 2, 319, 10.1007\u002FBF02187886\nBárány, 1988, Approximation of the sphere by polytopes having few vertices, Proc. Amer. Math. Soc., 102, 651, 10.2307\u002F2047241\nA. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, M. Simonovits, Approximation of radii and norm-maxima: randomization doesn't help, Proceeding of the 39th IEEE FOCS, 1998, pp. 244–251.\nBrieden, 2001, Deterministic and randomized polynomial-time approximation of radii, Mathematika, 28, 63, 10.1112\u002FS0025579300014364\nCarl, 1985, Inequalities of Berstein–Jackson-type and the degree of compactness of operators in Banach spaces, Ann. Inst. Fourier (Grenoble), 35, 79, 10.5802\u002Faif.1020\nCarl, 1988, Gelfand numbers of operators with values in a Hilbert space, Invent. Math., 94, 479, 10.1007\u002FBF01394273\nGritzmann, 1993, Computational complexity of inner and outer j-radii of polytopes in finite dimensional normed spaces, Math. Programming, 59, 163, 10.1007\u002FBF01581243\nM. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Second ed., Springer, Berlin, 1988, 1993.\nGruber, 1994, Approximation by convex polytopes, 173\nKlee, 1995, Convex polytopes and related complexes, 875\nKochol, 1994, Constructive approximation of a ball by polytopes, Math. Slovaca, 44, 99\nMatoušek, 2002\nSimonovits, 2003, How to compute the volume in high dimension?, Math. Programming, 97, 337, 10.1007\u002Fs10107-003-0447-x\nVaidya, 1996, A new algorithm for minimizing convex functions over convex sets, Math. Programming, 73, 291, 10.1007\u002FBF02592216",{"EN":259},"A note on approximation of a ball by polytopes",{"VOID":261},"10.1016\u002Fj.disopt.2004.07.003","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528604000295",[264],{"id":265,"sortIndex":19,"researcher":18,"roles":266,"affiliations":267,"properties":276},"78f441af-fe64-4810-a31d-e5d37f937fdb",[128],[268],{"id":18,"sortIndex":19,"affiliation":269,"properties":18},{"id":270,"createTime":271,"updateTime":271,"relativeEntities":272,"slug":18,"properties":273,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"7d9c0768-b7b3-4a30-8ed3-4927f37c342e","2023-12-12T19:25:10.447+00:00",[],{"title":274},{"VI":275},"MÚ SAV, Štefánikova 49, 814 73 Bratislava 1, Slovakia",{"title":277},{"VI":278},"Martin Kochol",{"url":262,"publisher":280,"properties":302},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":281,"slug":10,"properties":282,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":285,"manageAffiliations":286,"indexDatabases":287,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":283,"title":284},{"VOID":13},{"EN":15},[],[],[288,295],{"id":59,"indexDatabase":289,"url":72,"indexYears":73,"academicFieldIds":294,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":290,"label":291,"description":292,"key":69,"publicationTags":293,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":296,"url":95,"indexYears":18,"academicFieldIds":301,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":297,"label":298,"description":299,"key":91,"publicationTags":300,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":303,"pages":305},{"VOID":304},"1",{"VOID":306},"229-231","2004-11-01",2004,{"id":310,"createTime":311,"updateTime":312,"relativeEntities":313,"slug":314,"properties":315,"entityType":118,"verifyStatus":119,"verifyTime":322,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":323,"primaryUrl":324,"fullTextUrl":18,"authors":325,"publicationType":156,"publisherRelationship":498,"citationCount":18,"citationInfo":18,"publishDate":526,"publishYear":248,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"852c2c6d-a4e1-4092-a35c-01787c83a9e7","2023-12-06T20:17:50.218+00:00","2025-01-27T23:42:51.688+00:00",[],"Grundy-dominating-sequences-and-zero-forcing-sets",{"references":316,"title":318,"doi":320},{"VOID":317},"Brešar, 2014, Dominating sequences in graphs, Discrete Math., 336, 22, 10.1016\u002Fj.disc.2014.07.016\nBrešar, 2016, Dominating sequences under atomic changes with applications in Sierpiński and interval graphs, Appl. Anal. Discrete Math., 10, 518, 10.2298\u002FAADM161005024B\nBrešar, 2016, Dominating sequences in grid-like and toroidal graphs, Electron. J. Combin., 23, 19, 10.37236\u002F6269\nBrešar, 2016, Total dominating sequences in graphs, Discrete Math., 339, 1665, 10.1016\u002Fj.disc.2016.01.017\n2008, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl., 428, 1628, 10.1016\u002Fj.laa.2007.10.009\nK.F. Benson, D. Ferrero, M. Flagg, V. Furst, L. Hogben, V. Vasilevskak, B. Wissman, Power domination and zero forcing, arXiv:1510.02421 [math.CO].\nHaynes, 2002, Domination in graphs applied to electric power networks, SIAM J. Discrete Math., 15, 519, 10.1137\u002FS0895480100375831\nAazami, 2008\nBarioli, 2010, Zero forcing parameters and minimum rank problems, Linear Algebra Appl., 433, 401, 10.1016\u002Fj.laa.2010.03.008\nHuang, 2010, On minimum rank and zero forcing sets of a graph, Linear Algebra Appl., 432, 2961, 10.1016\u002Fj.laa.2010.01.001\nTaklimi, 2014, On the relationships between zero forcing numbers and certain graph coverings, Spec. Matrices, 2, 30\nHammack, 2011\nKlavžar, 1997, Graphs S(n,k) and a variant of the Tower of Hanoi problem, Czechoslovak Math. J., 47, 95, 10.1023\u002FA:1022444205860\nHinz, 2017, A survey and classification of Sierpiński-type graphs, Discrete Appl. Math., 217, 565, 10.1016\u002Fj.dam.2016.09.024\nB. Brešar, T. Kos, G. Nasini, P. Torres, Total dominating sequences in trees, split graphs, and under modular decomposition, arXiv:1608.06804 [math.CO].\nChang, 2012, Generalized power domination of graphs, Discrete Appl. Math., 160, 1691, 10.1016\u002Fj.dam.2012.03.007\nAmos, 2015, Upper bounds on the k-forcing number of a graph, Discrete Appl. Math., 181, 1, 10.1016\u002Fj.dam.2014.08.029\nD. Ferrero, L. Hogben, F.H.J. Kenter, M. Young, The relationship between k-forcing and k-power domination, arXiv:1701.08386 [math.CO].\nFink, 1985, On n-domination, n-dependence and forbidden subgraphs, 301\nArgiroffo, 2015, On the complexity of {k}-domination and k-tuple domination in graphs, Inform. Process. Lett., 115, 556, 10.1016\u002Fj.ipl.2015.01.007\nHansberg, 2009, Upper bounds on the k-domination number and the k-Roman domination number, Discrete Appl. Math., 157, 1634, 10.1016\u002Fj.dam.2008.10.011\nChellali, 2012, k-domination and k-independence in graphs: a survey, Graphs Combin., 28, 1, 10.1007\u002Fs00373-011-1040-3\nHogben, 2012, Propagation time for zero forcing on a graph, Discrete Appl. Math., 160, 1994, 10.1016\u002Fj.dam.2012.04.003\nAazami, 2010, Domination in graphs with bounded propagation: algorithms, formulations and hardness results, J. Comb. Optim., 19, 429, 10.1007\u002Fs10878-008-9176-7\nDorbec, 2014, Generalized power domination: propagation radius and Sierpiński graphs, Acta Appl. Math., 134, 75, 10.1007\u002Fs10440-014-9870-7\nLiao, 2016, Power domination with bounded time constraints, J. Comb. Optim., 31, 725, 10.1007\u002Fs10878-014-9785-2",{"EN":319},"Grundy dominating sequences and zero forcing sets",{"VOID":321},"10.1016\u002Fj.disopt.2017.07.001","2025-01-27T23:42:51.687+00:00",2,"https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528617300373",[326,344,369,382,401,423,446,478],{"id":327,"sortIndex":328,"researcher":18,"roles":329,"affiliations":330,"properties":341},"fe8cfd46-515e-47d7-83c7-bfbd729fca38",7,[128],[331],{"id":18,"sortIndex":19,"affiliation":332,"properties":18},{"id":333,"createTime":334,"updateTime":335,"relativeEntities":336,"slug":337,"properties":338,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"54c46083-3d35-4861-8566-da3d9d96bb8b","2024-01-06T08:27:04.839+00:00","2024-09-22T18:58:38.715+00:00",[],"Alfr%C3%A9d-R%C3%A9nyi-Institute-of-Mathematics-Hungarian-Academy-of-Sciences-Budapest-Hungary",{"title":339},{"VI":340},"Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary",{"title":342},{"VI":343},"Máté Vizer",{"id":345,"sortIndex":323,"researcher":18,"roles":346,"affiliations":347,"properties":366},"66fd0aa7-eccc-4dac-afdf-4a74b5051773",[128],[348,356],{"id":18,"sortIndex":19,"affiliation":349,"properties":18},{"id":350,"createTime":351,"updateTime":351,"relativeEntities":352,"slug":18,"properties":353,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"40bf5173-05bf-4baf-81e9-dfcce4a7f63f","2023-12-08T07:29:59.357+00:00",[],{"title":354},{"VI":355},"Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia",{"id":357,"sortIndex":126,"affiliation":358,"properties":365},"8b0a0cb8-812f-486f-8c24-b42226361104",{"id":359,"createTime":360,"updateTime":360,"relativeEntities":361,"slug":18,"properties":362,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"67444ba7-cdb8-4689-95a5-8eaaa1858829","2023-12-29T18:10:40.271+00:00",[],{"title":363},{"VI":364},"Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia",{},{"title":367},{"VI":368},"Tanja Gologranc",{"id":370,"sortIndex":371,"researcher":18,"roles":372,"affiliations":373,"properties":379},"0b869a6c-43bd-4ce9-b175-246c420d0510",5,[128],[374],{"id":18,"sortIndex":19,"affiliation":375,"properties":18},{"id":333,"createTime":334,"updateTime":335,"relativeEntities":376,"slug":337,"properties":377,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":378},{"VI":340},{"title":380},{"VI":381},"Balázs Patkós",{"id":383,"sortIndex":19,"researcher":18,"roles":384,"affiliations":385,"properties":398},"f88e6a63-39af-4b9f-95b2-45c77cc6ec57",[128],[386,391],{"id":18,"sortIndex":19,"affiliation":387,"properties":18},{"id":350,"createTime":351,"updateTime":351,"relativeEntities":388,"slug":18,"properties":389,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":390},{"VI":355},{"id":392,"sortIndex":126,"affiliation":393,"properties":397},"0a678cbe-55c1-416a-b70d-f97b419a3c7f",{"id":359,"createTime":360,"updateTime":360,"relativeEntities":394,"slug":18,"properties":395,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":396},{"VI":364},{},{"title":399},{"VI":400},"Boštjan Brešar",{"id":402,"sortIndex":126,"researcher":18,"roles":403,"affiliations":404,"properties":420},"2c630382-cb16-46a5-b59d-967e491d0dc7",[128],[405,413],{"id":18,"sortIndex":19,"affiliation":406,"properties":18},{"id":407,"createTime":408,"updateTime":408,"relativeEntities":409,"slug":18,"properties":410,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"88551543-8fd5-45de-96db-af8048712e51","2023-12-06T20:17:50.354+00:00",[],{"title":411},{"VI":412},"Faculty of Information Technology, University of Pannonia, Veszprém, Hungary",{"id":414,"sortIndex":126,"affiliation":415,"properties":419},"3db73b37-0db1-40ff-9c80-32eeab990979",{"id":333,"createTime":334,"updateTime":335,"relativeEntities":416,"slug":337,"properties":417,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":418},{"VI":340},{},{"title":421},{"VI":422},"Csilla Bujtás",{"id":424,"sortIndex":425,"researcher":18,"roles":426,"affiliations":427,"properties":443},"d9256211-6445-494e-89ad-eeb80db650ca",4,[128],[428,438],{"id":429,"sortIndex":126,"affiliation":430,"properties":437},"a42f43cd-f3a9-4b9b-a134-c0746e563126",{"id":431,"createTime":432,"updateTime":432,"relativeEntities":433,"slug":18,"properties":434,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"4d652c57-3862-460a-9075-aaef791f3b6c","2023-12-07T15:14:53.401+00:00",[],{"title":435},{"VI":436},"Abelium R&D, Ljubljana, Slovenia",{},{"id":18,"sortIndex":19,"affiliation":439,"properties":18},{"id":359,"createTime":360,"updateTime":360,"relativeEntities":440,"slug":18,"properties":441,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":442},{"VI":364},{"title":444},{"VI":445},"Gašper Košmrlj",{"id":447,"sortIndex":448,"researcher":18,"roles":449,"affiliations":450,"properties":475},"24f154e3-d1a7-4109-ad88-a4da5a0e5a68",3,[128],[451,458,465],{"id":452,"sortIndex":126,"affiliation":453,"properties":457},"60772456-05d0-406b-bc0a-7ce30e9f7fdf",{"id":350,"createTime":351,"updateTime":351,"relativeEntities":454,"slug":18,"properties":455,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":456},{"VI":355},{},{"id":459,"sortIndex":323,"affiliation":460,"properties":464},"adf38b03-63e7-4ab1-9383-0c72a9b75742",{"id":359,"createTime":360,"updateTime":360,"relativeEntities":461,"slug":18,"properties":462,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":463},{"VI":364},{},{"id":18,"sortIndex":19,"affiliation":466,"properties":18},{"id":467,"createTime":468,"updateTime":469,"relativeEntities":470,"slug":471,"properties":472,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"0ef0ce89-69ef-4183-b299-ab7d485c05a2","2023-12-05T09:37:04.359+00:00","2024-09-05T03:37:32.983+00:00",[],"Faculty-of-Mathematics-and-Physics-University-of-Ljubljana-Slovenia",{"title":473},{"VI":474},"Faculty of Mathematics and Physics, University of Ljubljana, Slovenia",{"title":476},{"VI":477},"Sandi Klavžar",{"id":479,"sortIndex":480,"researcher":18,"roles":481,"affiliations":482,"properties":495},"94b3aa24-b6c7-4a6f-a418-792502b2e7f8",6,[128],[483,490],{"id":484,"sortIndex":126,"affiliation":485,"properties":489},"ecae5563-5bf0-4d81-b43a-0190dd4c164e",{"id":333,"createTime":334,"updateTime":335,"relativeEntities":486,"slug":337,"properties":487,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":488},{"VI":340},{},{"id":18,"sortIndex":19,"affiliation":491,"properties":18},{"id":407,"createTime":408,"updateTime":408,"relativeEntities":492,"slug":18,"properties":493,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":494},{"VI":412},{"title":496},{"VI":497},"Zsolt Tuza",{"url":324,"publisher":499,"properties":521},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":500,"slug":10,"properties":501,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":504,"manageAffiliations":505,"indexDatabases":506,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":502,"title":503},{"VOID":13},{"EN":15},[],[],[507,514],{"id":59,"indexDatabase":508,"url":72,"indexYears":73,"academicFieldIds":513,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":509,"label":510,"description":511,"key":69,"publicationTags":512,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":515,"url":95,"indexYears":18,"academicFieldIds":520,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":516,"label":517,"description":518,"key":91,"publicationTags":519,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":522,"pages":524},{"VOID":523},"26",{"VOID":525},"66-77","2017-11-01",{"id":528,"createTime":529,"updateTime":530,"relativeEntities":531,"slug":532,"properties":533,"entityType":118,"verifyStatus":119,"verifyTime":530,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":540,"fullTextUrl":18,"authors":541,"publicationType":156,"publisherRelationship":569,"citationCount":18,"citationInfo":18,"publishDate":597,"publishYear":598,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"26b0e4d5-2f22-47a9-a196-c755d7f4d55a","2024-01-20T09:24:41.568+00:00","2025-01-24T23:41:36.838+00:00",[],"A-convex-cover-for-closed-unit-curves-has-area-at-least-0-1",{"references":534,"title":536,"doi":538},{"VOID":535},"Moser, 1966, Poorly formulated unsolved problems of combinatorial geometry, Mimeographed list\nMoser, 1991, Problems, problems, problems, Discrete Appl. Math., 31.02, 201, 10.1016\u002F0166-218X(91)90071-4\nNorwood, 2003, An improved upper bound for Leo Moser’s worm problem, Discrete Comput. Geom., 29.03, 409, 10.1007\u002Fs00454-002-0774-3\nMarstrand, 1979, Packing smooth curves in Rq, Mathematika., 26.01, 1, 10.1112\u002FS0025579300009542\nWetzel, 2005, The classical worm problem—A status report, Geombinatorics., 15, 34\nLaidacker, 1986\nPanraksa, 2020, Wetzel’s sector covers unit arcs, Period. Math. Hungar., 1\nKhandhawit, 2013, Lower bound for convex hull area and universal cover problems, Internat. J. Comput. Geom. Appl., 23.03, 197, 10.1142\u002FS0218195913500076\nBrass, 2005, A lower bound for Lebesgue’s universal cover problem, Internat. J. Comput. Geom. Appl., 15.05, 537, 10.1142\u002FS0218195905001828\nGibbs, 2018\nEggleston, 2007\nSchaer, 1972, Boxes for curves of constant length, Israel J. Math., 12.03, 257, 10.1007\u002FBF02790752\nFüredi, 2011, Covers for closed curves of length two, Period. Math. Hungar., 63.01, 1, 10.1007\u002Fs10998-011-7001-z\nWichiramala, 2018, A smaller cover for closed unit curves, Miskolc Math. Notes, 19.01, 691, 10.18514\u002FMMN.2018.2485\nChakerian, 1971, Minimal covers for closed curves, Math. Mag., 46.02, 55\nFáry, 1950, Der zentralsymmetrische Kern und die zentralsymmetrische Hülle von konvexen Körpern, Math. Ann., 122.03, 205, 10.1007\u002FBF01342966\nSom-am, 2010\nB. Grechuk, S. Som-am, A convex cover for closed unit curves has area at least 0.0975, Internat. J. Comput. Geom. Appl. To appear.",{"EN":537},"A convex cover for closed unit curves has area at least 0.1",{"VOID":539},"10.1016\u002Fj.disopt.2020.100608","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528620300426",[542,557],{"id":543,"sortIndex":126,"researcher":18,"roles":544,"affiliations":545,"properties":554},"600b3990-5649-45c5-a7e2-5a94aa55200d",[128],[546],{"id":18,"sortIndex":19,"affiliation":547,"properties":18},{"id":548,"createTime":549,"updateTime":549,"relativeEntities":550,"slug":18,"properties":551,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"3d3df41a-5cd2-4de5-b3a3-cc2c29d41e39","2024-01-20T09:24:41.590+00:00",[],{"title":552},{"VI":553},"School of Mathematics and Actuarial Science, University of Leicester, Leicester LE1 7RH, United Kingdom",{"title":555},{"VI":556},"Sittichoke Som-am",{"id":558,"sortIndex":19,"researcher":18,"roles":559,"affiliations":560,"properties":566},"d93ec590-ac32-4c8a-85a0-9c80a6cf99dc",[128],[561],{"id":18,"sortIndex":19,"affiliation":562,"properties":18},{"id":548,"createTime":549,"updateTime":549,"relativeEntities":563,"slug":18,"properties":564,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":565},{"VI":553},{"title":567},{"VI":568},"Bogdan Grechuk",{"url":540,"publisher":570,"properties":592},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":571,"slug":10,"properties":572,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":575,"manageAffiliations":576,"indexDatabases":577,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":573,"title":574},{"VOID":13},{"EN":15},[],[],[578,585],{"id":59,"indexDatabase":579,"url":72,"indexYears":73,"academicFieldIds":584,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":580,"label":581,"description":582,"key":69,"publicationTags":583,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":586,"url":95,"indexYears":18,"academicFieldIds":591,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":587,"label":588,"description":589,"key":91,"publicationTags":590,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":593,"pages":595},{"VOID":594},"38",{"VOID":596},"100608","2020-11-01",2020,{"id":600,"createTime":601,"updateTime":602,"relativeEntities":603,"slug":604,"properties":605,"entityType":118,"verifyStatus":119,"verifyTime":602,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":612,"fullTextUrl":18,"authors":613,"publicationType":156,"publisherRelationship":655,"citationCount":18,"citationInfo":18,"publishDate":683,"publishYear":684,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"97484220-a30a-4fc9-8682-96bca148a9f1","2023-11-28T03:09:23.074+00:00","2024-12-10T23:41:28.033+00:00",[],"Batched-bin-packing",{"references":606,"title":608,"doi":610},{"VOID":607},"D.J. Brown, A lower bound for on-line one-dimensional bin packing algorithms, Technical Report R-864, Coordinated Science Laboratory, Urbana, IL, 1979.\nChandra, 1992, Does randomization help in on-line bin packing?, Inform. Process. Lett., 43, 15, 10.1016\u002F0020-0190(92)90023-O\nCoffman, 1999, Bin packing approximation algorithms, 151\nCoffman, 1996, Approximation Algorithms for bin packing, 46\nJ. Csirik, G. Woeginger, On-line packing and covering problems, in: A. Fiat, G. Woeginger (Eds.), On-line Algorithms—The State of the Art, Lecture Notes in Computer Science, vol. 1442, Springer, New York, 1998, pp. 147–177.\nDiestel, 2000\nFaigle, 1989, On the performance of on-line algorithms for partition problems, Acta Cybernet., 9, 107\nGalambos, 1993, Repacking helps in bounded space on-line bin-packing, Computing, 49, 329, 10.1007\u002FBF02248693\nE.F. Grove, Online bin packing with lookahead, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 430–436.\nG. Gutin, T. Jensen, A. Yeo, Optimal on-line bin packing with two item sizes, submitted.\nIvković, 1997, Partially dynamic bin packing can be solved within 1+ε in (amortized) polylogarithmic time, Inform. Process. Lett., 63, 45, 10.1016\u002FS0020-0190(97)00092-6\nIvković, 1998, Fully dynamic algorithms for bin packing, SIAM J. Comput., 28, 574, 10.1137\u002FS0097539794276749\nLee, 1985, A simple on-line packing algorithm, J. ACM, 32, 562, 10.1145\u002F3828.3833\nLiang, 1980, A lower bound for online bin packing, Inform. Process. Lett., 10, 76, 10.1016\u002FS0020-0190(80)90077-0\nvan Vliet, 1992, An improved lower bound for online bin packing algorithms, Inform. Process. Lett., 43, 277, 10.1016\u002F0020-0190(92)90223-I\nYao, 1980, New algorithms for bin packing, J. ACM, 27, 207, 10.1145\u002F322186.322187\nZhang, 2001, An on-line bin batching problem, Discrete Appl. Math., 108, 329, 10.1016\u002FS0166-218X(00)00243-2\nZhang, 2003, Scheduling two groups of jobs with incomplete information, J. System Sci. Systems Eng., 12, 73, 10.1007\u002Fs11518-006-0121-y",{"EN":609},"Batched bin packing",{"VOID":611},"10.1016\u002Fj.disopt.2004.11.001","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528605000058",[614,631,643],{"id":615,"sortIndex":323,"researcher":18,"roles":616,"affiliations":617,"properties":628},"91728a80-f15e-4700-93e3-28328d9bb584",[128],[618],{"id":18,"sortIndex":19,"affiliation":619,"properties":18},{"id":620,"createTime":621,"updateTime":622,"relativeEntities":623,"slug":624,"properties":625,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"6891b9a4-9fcb-4ea5-b4ea-783a46a1de41","2023-12-20T12:16:17.820+00:00","2024-12-22T06:39:02.707+00:00",[],"Department-of-Computer-Science-Royal-Holloway-University-of-London-Egham-Surrey-TW20-0EX-UK",{"title":626},{"VI":627},"Department of Computer Science, Royal Holloway University of London, Egham, Surrey, TW20 0EX, UK",{"title":629},{"VI":630},"Anders Yeo",{"id":632,"sortIndex":19,"researcher":18,"roles":633,"affiliations":634,"properties":640},"f4733025-9fa3-426a-aead-2ebe242717f4",[128],[635],{"id":18,"sortIndex":19,"affiliation":636,"properties":18},{"id":620,"createTime":621,"updateTime":622,"relativeEntities":637,"slug":624,"properties":638,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":639},{"VI":627},{"title":641},{"VI":642},"Gregory Gutin",{"id":644,"sortIndex":126,"researcher":18,"roles":645,"affiliations":646,"properties":652},"1e5dd63c-8455-48c6-a31a-f7e4a47ea9c1",[128],[647],{"id":18,"sortIndex":19,"affiliation":648,"properties":18},{"id":620,"createTime":621,"updateTime":622,"relativeEntities":649,"slug":624,"properties":650,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":651},{"VI":627},{"title":653},{"VI":654},"Tommy Jensen",{"url":612,"publisher":656,"properties":678},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":657,"slug":10,"properties":658,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":661,"manageAffiliations":662,"indexDatabases":663,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":659,"title":660},{"VOID":13},{"EN":15},[],[],[664,671],{"id":59,"indexDatabase":665,"url":72,"indexYears":73,"academicFieldIds":670,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":666,"label":667,"description":668,"key":69,"publicationTags":669,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":672,"url":95,"indexYears":18,"academicFieldIds":677,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":673,"label":674,"description":675,"key":91,"publicationTags":676,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":679,"pages":681},{"VOID":680},"2",{"VOID":682},"71-82","2005-03-01",2005,{"id":686,"createTime":687,"updateTime":688,"relativeEntities":689,"slug":690,"properties":691,"entityType":118,"verifyStatus":119,"verifyTime":700,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":701,"fullTextUrl":18,"authors":702,"publicationType":156,"publisherRelationship":751,"citationCount":19,"citationInfo":779,"publishDate":781,"publishYear":782,"citationAnalyzeStatus":783,"lastCitationAnalyze":688,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"10fb0abf-8b85-4ae6-80f8-cc215e3679f4","2023-12-31T19:47:04.639+00:00","2026-06-05T23:40:26.965+00:00",[],"Parameterized-algorithms-for-generalizations-of-Directed-Feedback-Vertex-Set",{"references":692,"title":694,"doi":696,"gsPaper":698},{"VOID":693},"Göke, 2019, Parameterized algorithms for generalizations of directed feedback vertex set, vol. 11458, 249\nKarp, 1972, Reducibility among combinatorial problems, 85\nSeymour, 1995, Packing directed circuits fractionally, Combinatorica, 15, 281, 10.1007\u002FBF01200760\nEven, 1998, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20, 151, 10.1007\u002FPL00009191\nEven, 2000, Divide-and-conquer approximation algorithms via spreading metrics, J. ACM, 47, 585, 10.1145\u002F347476.347478\nGuruswami, 2011, Beating the random ordering is hard: every ordering CSP is approximation resistant, SIAM J. Comput., 40, 878, 10.1137\u002F090756144\nGuruswami, 2016, Simple proof of hardness of feedback vertex set, Theory Comput., 12, 10.4086\u002Ftoc.2016.v012a006\nSvensson, 2013, Hardness of vertex deletion and project scheduling, Theory Comput., 9, 759, 10.4086\u002Ftoc.2013.v009a024\nD. Lokshtanov, M.S. Ramanujan, S. Saurabh, When recursion is better than iteration: A linear-time algorithm for acyclicity with few error vertices, in: Proc. SODA 2018, 2018, pp. 1916–1933.\nChitnis, 2015, Directed subset feedback vertex set is fixed-parameter tractable, ACM Trans. Algorithms, 11, 10.1145\u002F2700209\nD. Lokshtanov, M. Ramanujan, S. Saurabh, Parameterized Complexity and Approximability of Directed Odd Cycle Transversal, in: Proc. SODA 2020, 2020, pp. 2181–2200.\nGöke, 2020, Hitting long directed cycles is fixed-parameter tractable, vol. 168, 59:1\nCechlárová, 2010, Computing the deficiency of housing markets with duplicate houses, vol. 6478, 72\nMarx, 2012, What’s next? Future directions in parameterized complexity, vol. 7370, 469\nKumar, 2017, A 2ℓk Kernel for ℓ-component order connectivity, vol. 63, 20:1\nXiao, 2017, Linear kernels for separating a graph into components of bounded size, J. Comput. System Sci., 88, 260, 10.1016\u002Fj.jcss.2017.04.004\nChen, 2008, A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, 55, 10.1145\u002F1411509.1411511\nFortune, 1980, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10, 111, 10.1016\u002F0304-3975(80)90009-2\nBang-Jensen, 2016, DAG-width and circumference of digraphs, J. Graph Theory, 82, 194, 10.1002\u002Fjgt.21894\nChitnis, 2013, Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset, SIAM J. Comput., 42, 1674, 10.1137\u002F12086217X\nCygan, 2014, Parameterized complexity of Eulerian deletion problems, Algorithmica, 68, 41, 10.1007\u002Fs00453-012-9667-x\nBang-Jensen, 2020, Component order connectivity in directed graphs, vol. 180, 2:1\nDrange, 2016, On the computational complexity of vertex integrity and component order connectivity, Algorithmica, 76, 1181, 10.1007\u002Fs00453-016-0127-x\nNeogi, 2020, On the parameterized complexity of deletion to H-free strong components, vol. 170, 75:1",{"EN":695},"Parameterized algorithms for generalizations of Directed Feedback Vertex Set",{"VOID":697},"10.1016\u002Fj.disopt.2022.100740",{"VOID":699},"[\"15245965761918778160\",\"17526122136176151182\"]","2024-05-14T16:46:24.762+00:00","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528622000457",[703,718,732],{"id":704,"sortIndex":19,"researcher":18,"roles":705,"affiliations":706,"properties":715},"bf694847-c5b4-4fac-85d5-e7e3a4051ddf",[128],[707],{"id":18,"sortIndex":19,"affiliation":708,"properties":18},{"id":709,"createTime":710,"updateTime":710,"relativeEntities":711,"slug":18,"properties":712,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"2bcc5bb7-0f80-47ba-8461-874e62bb683c","2024-02-12T05:27:09.696+00:00",[],{"title":713},{"VI":714},"Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany",{"title":716},{"VI":717},"Alexander Göke",{"id":719,"sortIndex":323,"researcher":18,"roles":720,"affiliations":721,"properties":727},"a9935de9-e1b9-4d63-ba92-23a299029820",[128],[722],{"id":18,"sortIndex":19,"affiliation":723,"properties":18},{"id":709,"createTime":710,"updateTime":710,"relativeEntities":724,"slug":18,"properties":725,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":726},{"VI":714},{"title":728,"gsAuthor":730},{"VI":729},"Matthias Mnich",{"VOID":731},"[\"5LvVxNYAAAAJ\"]",{"id":733,"sortIndex":126,"researcher":18,"roles":734,"affiliations":735,"properties":746},"f0f2ffca-bda1-4a60-b721-db28d1833081",[128],[736],{"id":18,"sortIndex":19,"affiliation":737,"properties":18},{"id":738,"createTime":739,"updateTime":740,"relativeEntities":741,"slug":742,"properties":743,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"05eb7039-33cb-42ed-86b9-88f6e6d36712","2024-01-09T01:54:43.708+00:00","2025-06-11T19:02:56.287+00:00",[],"CISPA-Helmholtz-Center-for-Information-Security-Saarbr%C3%BCcken-Germany",{"title":744},{"VI":745},"CISPA Helmholtz Center for Information Security, Saarbrücken, Germany",{"title":747,"gsAuthor":749},{"VI":748},"Dániel Marx",{"VOID":750},"[\"hY2ibr8AAAAJ\"]",{"url":701,"publisher":752,"properties":774},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":753,"slug":10,"properties":754,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":757,"manageAffiliations":758,"indexDatabases":759,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":755,"title":756},{"VOID":13},{"EN":15},[],[],[760,767],{"id":59,"indexDatabase":761,"url":72,"indexYears":73,"academicFieldIds":766,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":762,"label":763,"description":764,"key":69,"publicationTags":765,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":768,"url":95,"indexYears":18,"academicFieldIds":773,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":769,"label":770,"description":771,"key":91,"publicationTags":772,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":775,"pages":777},{"VOID":776},"46",{"VOID":778},"100740",{"total":19,"publishYear":19,"statisticByYear":780},{},"2022-11-01",2022,"ERROR_IN_ANALYZE_CITATION",{"id":785,"createTime":786,"updateTime":787,"relativeEntities":788,"slug":789,"properties":790,"entityType":118,"verifyStatus":119,"verifyTime":787,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":797,"fullTextUrl":18,"authors":798,"publicationType":156,"publisherRelationship":841,"citationCount":18,"citationInfo":18,"publishDate":869,"publishYear":870,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"e5ccfd75-5081-4483-af4e-2059cd31f946","2023-12-08T16:37:30.309+00:00","2025-02-16T23:30:35.905+00:00",[],"Strong-valid-inequalities-for-the-resource-constrained-scheduling-problem-with-uniform-resource-requirements",{"references":791,"title":793,"doi":795},{"VOID":792},"1999\nHartmann, 2000, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, European Journal of Operational Research, 127, 394, 10.1016\u002FS0377-2217(99)00485-3\nDemeulemeester, 2002\nValls, 2003, Resource-constrained project scheduling: A critical activity reordering heuristic, European Journal of Operational Research, 149, 282, 10.1016\u002FS0377-2217(02)00768-3\nFleszar, 2004, Solving the resource-constrained project scheduling problem by a variable neighbourhood search, European Journal of Operational Research, 155, 402, 10.1016\u002FS0377-2217(02)00884-6\nZhang, 2006, Particle swarm optimization for resource-constrained project scheduling, International Journal of Project Management, 24, 83, 10.1016\u002Fj.ijproman.2005.06.006\nRemy, 2004, Resource constrained scheduling on multiple machines, Information Processing Letters, 91, 177, 10.1016\u002Fj.ipl.2004.04.009\nDemeulemeester, 1992, A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management Science, 38, 1803, 10.1287\u002Fmnsc.38.12.1803\nBrücker, 2000, A linear programming and constraint propagation-based lower vound for the RCPSP, European Journal of Operational Research, 127, 355, 10.1016\u002FS0377-2217(99)00489-0\nZamani, 2001, A high-performance exact method for the resource-constrained project scheduling problem, Computers & Operations Research, 28, 1387, 10.1016\u002FS0305-0548(00)00048-4\nMingozzi, 1998, An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation, Management Science, 44, 714, 10.1287\u002Fmnsc.44.5.714\nMöhring, 2003, Solving project scheduling problems by minimum cut computations, Management Science, 49, 330, 10.1287\u002Fmnsc.49.3.330.12737\nHerroelen, 1998, Resource-constrained project scheduling: A survey of recent developments, Computers & Operations Research, 25, 279, 10.1016\u002FS0305-0548(97)00055-5\nAlvarez-Valdés, 1993, The project scheduling polyhedron: Dimension, facets, and lifting theorems, European Journal of Operational Research, 67, 204, 10.1016\u002F0377-2217(93)90062-R\nChristofides, 1987, Project scheduling with resource constraints: A branch and bound approach, European Journal of Operational Research, 29, 262, 10.1016\u002F0377-2217(87)90240-2\nP. Coll, C. Ribeiro, C. de Souza, Multiprocessor scheduling under precedence constraints: Polyhedral results, Optimization Online: http:\u002F\u002Fwww.optimization-online.org\u002FDB_HTML\u002F2003\u002F10\u002F752.html, 2003\nKis, 2005, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, Mathematical Programming, Series A, 103, 515, 10.1007\u002Fs10107-004-0551-6\nDorndorf, 2000, A branch-and-bound algorithm for the resource-constrained project scheduling problem, Mathematical Methods of Operations Research, 52, 413, 10.1007\u002Fs001860000091\nDorndorf, 2000, A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints, Management Science, 46, 1365, 10.1287\u002Fmnsc.46.10.1365.12272\nDemassey, 2005, Constraint propagation based cutting planes: An application to the resource-constrained project scheduling problem, INFORMS Journal on Computing, 17, 52, 10.1287\u002Fijoc.1030.0043\nC. Cavalcante, C. DeSouza, M. Savelsbergh, Y. Wang, L. Wolsey, Scheduling projects with labor constraints, CORE Discussion Paper 9859, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998\nSankaran, 1999, A strong fractional cutting-plane algorithm for resource-constrained project scheduling, International Journal of Industrial Engineering, 6, 99\nDrozdowski, 1996, Scheduling multiprocessor tasks—An overview, European Journal of Operational Research, 94, 215, 10.1016\u002F0377-2217(96)00123-3\nChen, 1999, General multiprocessor task scheduling, Naval Research Logistics, 46, 57, 10.1002\u002F(SICI)1520-6750(199902)46:1\u003C57::AID-NAV4>3.0.CO;2-H\nLee, 1999, Scheduling one and two-processor tasks on two parallel processors, IIE Transactions, 31, 445, 10.1080\u002F07408179908969847\nR. Möhring, M. Uetz, Scheduling scarce resources in chemical engineering, Technical Report 682, Technische Universität Berlin, Germany, 2000\nP. Brücker, S. Knust, Complexity results for scheduling problems, http:\u002F\u002Fwww.mathematik.uni-osnabrueck.de\u002Fresearch\u002FOR\u002Fclass\u002F\nConway, 1967\nM. Queyranne, A. Schulz, Polyhedral approaches to machine scheduling, Technical Report 408, Technische Universität Berlin, Germany, 1994\nJ. Hardin, Resource-constrained scheduling and production planning: Linear programming-based studies, Ph.D. Thesis, Georgia Institute of Technology, 2001\nWolsey, 1977, Valid inequalities and superadditivity for 0-1 integer programs, Mathematics of Operations Research, 2, 66, 10.1287\u002Fmoor.2.1.66\nGu, 2000, Sequence independent lifting in mixed integer programming, Journal of Combinatorial Optimization, 4, 109, 10.1023\u002FA:1009841107478\nBalas, 1975, Facets of the knapsack polytope, Mathematical Programming, 8, 146, 10.1007\u002FBF01580440\nNemhauser, 1988\nWolsey, 1990, Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints, Discrete Applied Mathematics, 29, 251, 10.1016\u002F0166-218X(90)90148-6\nGu, 1998, Cover inequalities for 0-1 linear programs: Computation, INFORMS Journal on Computing, 10, 427, 10.1287\u002Fijoc.10.4.427\nVan den Akker, 1999, A polyhedral approach to single-machine scheduling problems, Mathematical Programming, Series A, 85, 541, 10.1007\u002Fs101070050071",{"EN":794},"Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements",{"VOID":796},"10.1016\u002Fj.disopt.2007.10.003","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS157252860700059X",[799,814,829],{"id":800,"sortIndex":19,"researcher":18,"roles":801,"affiliations":802,"properties":811},"aa1f3724-b63c-4cef-b21e-ebf2af656d5c",[128],[803],{"id":18,"sortIndex":19,"affiliation":804,"properties":18},{"id":805,"createTime":806,"updateTime":806,"relativeEntities":807,"slug":18,"properties":808,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"eee5fbea-879f-4405-9194-e0007aa2a41e","2023-12-08T16:37:30.319+00:00",[],{"title":809},{"VI":810},"Department of Statistical Sciences and Operations Research, Virginia Commonwealth University, 1001 West Main Street, P.O. Box 843083, Richmond, VA 23284-3083, United States",{"title":812},{"VI":813},"Jill R. Hardin",{"id":815,"sortIndex":323,"researcher":18,"roles":816,"affiliations":817,"properties":826},"369306cb-5262-42c2-8c5b-382fe918d1a8",[128],[818],{"id":18,"sortIndex":19,"affiliation":819,"properties":18},{"id":820,"createTime":821,"updateTime":821,"relativeEntities":822,"slug":18,"properties":823,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"0d73d719-ad35-4d22-9ee5-d4d08d09a847","2023-12-08T16:37:30.340+00:00",[],{"title":824},{"VI":825},"School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, NW, Atlanta, GA 30332-0205, United States",{"title":827},{"VI":828},"Martin W.P. Savelsbergh",{"id":830,"sortIndex":126,"researcher":18,"roles":831,"affiliations":832,"properties":838},"c044d0f5-14c3-4b6a-8bb2-56f1cdc83c10",[128],[833],{"id":18,"sortIndex":19,"affiliation":834,"properties":18},{"id":820,"createTime":821,"updateTime":821,"relativeEntities":835,"slug":18,"properties":836,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},[],{"title":837},{"VI":825},{"title":839},{"VI":840},"George L. Nemhauser",{"url":797,"publisher":842,"properties":864},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":843,"slug":10,"properties":844,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":847,"manageAffiliations":848,"indexDatabases":849,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":845,"title":846},{"VOID":13},{"EN":15},[],[],[850,857],{"id":59,"indexDatabase":851,"url":72,"indexYears":73,"academicFieldIds":856,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":852,"label":853,"description":854,"key":69,"publicationTags":855,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":858,"url":95,"indexYears":18,"academicFieldIds":863,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":859,"label":860,"description":861,"key":91,"publicationTags":862,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":865,"pages":867},{"VOID":866},"5",{"VOID":868},"19-35","2008-02-01",2008,{"id":872,"createTime":873,"updateTime":873,"relativeEntities":874,"slug":18,"properties":875,"entityType":118,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":882,"fullTextUrl":18,"authors":883,"publicationType":156,"publisherRelationship":924,"citationCount":18,"citationInfo":18,"publishDate":951,"publishYear":870,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"1696ecf7-300b-402f-ba13-91c56e96b0de","2024-01-11T23:26:15.513+00:00",[],{"references":876,"title":878,"doi":880},{"VOID":877},"Ahuja, 1993\nBalas, 1975, Facets of the knapsack polytope, Mathematical Programming, 8, 146, 10.1007\u002FBF01580440\nBalas, 1977, Critical cutsets of graphs and canonical facets of set-packing polytopes, Mathematics of Operations Research, 2, 15, 10.1287\u002Fmoor.2.1.15\nBalas, 1978, Facets of the knapsack polytope from minimal covers, SIAM Journal on Applied Mathematics, 34, 119, 10.1137\u002F0134010\nBazaraa, 2005\nBazaraa, 2006\nCornuéjols, 1989, On the 0–1 facets of the set covering polytope, Mathematical Programming, 43, 45, 10.1007\u002FBF01582277\nCrowder, 1983, Solving large-scale zero–one linear programming problems, Operations Research, 31, 803, 10.1287\u002Fopre.31.5.803\nGeoffrion, 1969, An improved implicit enumeration approach for integer programming, Operations Research, 17, 437, 10.1287\u002Fopre.17.3.437\nGlover, 1965, A multiphase-dual algorithm for the zero–one integer programming problem, Operations Research, 13, 879, 10.1287\u002Fopre.13.6.879\nGlover, 1971, Flows in arborescences, Management Science, 17, 568, 10.1287\u002Fmnsc.17.9.568\nF. Glover, H.D. Sherali, Second order cover cuts, Mathematical Programming (ISSN: 0025-5610 1436-4646) (2007), doi:10.1007\u002Fs10107-007-0098-4. (Online)\nGlover, 2005, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints, Annals of Operations Research, State-of-the-Art in Integer Programming, 140, 215, 10.1007\u002Fs10479-005-3972-6\nGlover, 1997, Generating cuts from surrogate constraint analysis for zero–one and multiple choice programming, Computational Optimization and Applications, 8, 152, 10.1023\u002FA:1008621204567\nGu, 1998, Cover inequalities for 0–1 linear programs: Computation, INFORMS Journal on Computing, 10, 427, 10.1287\u002Fijoc.10.4.427\nGu, 2000, Sequence independent lifting in mixed integer programming, Journal of Combinatorial Optimization, 4, 109, 10.1023\u002FA:1009841107478\nHammer, 1975, Facets of regular 0–1 polytopes, Mathematical Programming, 8, 179, 10.1007\u002FBF01580442\nS. Hanafi, Contribution à la résolution de problèmes duaux de grande taille en optimisation combinatoire, Ph.D. Thesis, University of Valenciennes, France, 1993\nS. Hanafi, F. Glover, Exploiting nested inequalities and surrogate constraints, Research Report, University of Valenciennes, France, and University of Colorado, Boulder, CO, 2005\nJohnson, 1981, A note on the knapsack problem with special ordered sets, Operations Research Letters, 1, 18, 10.1016\u002F0167-6377(81)90019-5\nLaurent, 1989, A generalization of antiwebs to independence systems and their canonical facets, Mathematical Programming, 45, 97, 10.1007\u002FBF01589098\nMoura, 2003, Rank inequalities and separation algorithms for packing designs and sparse triple systems, Theoretical Computer Science, 297, 367, 10.1016\u002FS0304-3975(02)00648-5\nNemhauser, 1994, Lifted cover facets of the 0–1 knapsack polytope with GUB constraints, Operations Research Letters, 16, 255, 10.1016\u002F0167-6377(94)90038-8\nNemhauser, 1999\nNemhauser, 1994, MINTO, a mixed INTeger optimizer, Operations Research Letters, 15, 47, 10.1016\u002F0167-6377(94)90013-2\nOsorio, 2002, Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Annals of Operations Research, 117, 71, 10.1023\u002FA:1021513321301\nSavelsbergh, 1994, Preprocessing and probing for mixed integer programming problems, ORSA Journal on Computing, 6, 445, 10.1287\u002Fijoc.6.4.445\nSherali, 1995, Sequential and simultaneous liftings of minimal cover inequalities for generalized upper bound constrained knapsack polytopes, SIAM Journal on Discrete Mathematics, 8, 133, 10.1137\u002FS0895480192230607\nSherali, 1992, A global optimization algorithm for polynomial programming problems using a reformulation–linearization technique, Journal of Global Optimization, 2, 101, 10.1007\u002FBF00121304\nK. Spielberg, M. Guignard, A sequential (quasi) hot start method for BB (0, 1) mixed integer programming, in: Mathematical Programming Symposium, Atlanta, GA, 2000\nVasquez, 2005, Improved results on the 0–1 multidimensional knapsack problem, European Journal of Operational Research, 165, 70, 10.1016\u002Fj.ejor.2004.01.024\nWolsey, 1975, Faces for a linear inequality in 0-1 variables, Mathematical Programming, 8, 165, 10.1007\u002FBF01580441\nZemel, 1989, Easily computable facets of the knapsack polytope, Mathematics of Operations Research, 14, 760, 10.1287\u002Fmoor.14.4.760\nB. Zeng, J.-P.P. Richard, Sequence independent lifting for 0–1 knapsack problems with disjoint cardinality constraints, School of Industrial Engineering, Purdue University, West Lafayette, IN, 2006, Manuscript",{"EN":879},"Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities",{"VOID":881},"10.1016\u002Fj.disopt.2007.02.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528607000345",[884,903],{"id":885,"sortIndex":126,"researcher":18,"roles":886,"affiliations":887,"properties":900},"c7610baa-35ff-4bd9-9c98-735adcf0a5f8",[128],[888],{"id":889,"sortIndex":19,"affiliation":890,"properties":897},"aab9618e-3853-4a1b-98da-1a70df6301af",{"id":891,"createTime":892,"updateTime":892,"relativeEntities":893,"slug":18,"properties":894,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"663f41a6-060a-41c6-8102-301b051e6e7b","2024-01-26T14:06:17.359+00:00",[],{"title":895},{"VI":896},"Leeds School of Business, University of Colorado, Boulder, CO 80309-0419, USA",{"title":898},{"VI":899},"Leeds School of Business, University of Colorado, Boulder, CO 80309-0419, United States",{"title":901},{"VI":902},"Fred Glover",{"id":904,"sortIndex":19,"researcher":18,"roles":905,"affiliations":906,"properties":921},"11c1b2b5-9f6e-4570-bc99-50ae44dfef69",[128],[907],{"id":908,"sortIndex":19,"affiliation":909,"properties":918},"722a430e-fe3a-4862-810a-896b9aa0b393",{"id":910,"createTime":911,"updateTime":912,"relativeEntities":913,"slug":914,"properties":915,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"ba09fa42-4975-4f60-b082-f29289c30a76","2024-02-13T17:30:37.331+00:00","2024-09-02T03:54:31.340+00:00",[],"Grado-Department-of-Industrial-and-Systems-Engineering-Virginia-Polytechnic-Institute-and-State-University-Blacksburg-VA-24061-USA",{"title":916},{"VI":917},"Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA",{"title":919},{"VI":920},"Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, United States",{"title":922},{"VI":923},"Hanif D. Sherali",{"url":882,"publisher":925,"properties":947},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":926,"slug":10,"properties":927,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":930,"manageAffiliations":931,"indexDatabases":932,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":928,"title":929},{"VOID":13},{"EN":15},[],[],[933,940],{"id":59,"indexDatabase":934,"url":72,"indexYears":73,"academicFieldIds":939,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":935,"label":936,"description":937,"key":69,"publicationTags":938,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":941,"url":95,"indexYears":18,"academicFieldIds":946,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":942,"label":943,"description":944,"key":91,"publicationTags":945,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":948,"pages":949},{"VOID":866},{"VOID":950},"270-289","2008-05-01",{"id":953,"createTime":954,"updateTime":955,"relativeEntities":956,"slug":957,"properties":958,"entityType":118,"verifyStatus":119,"verifyTime":955,"verifyNote":121,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"primaryUrl":965,"fullTextUrl":18,"authors":966,"publicationType":156,"publisherRelationship":997,"citationCount":18,"citationInfo":18,"publishDate":869,"publishYear":870,"citationAnalyzeStatus":17,"lastCitationAnalyze":18,"indexDatabases":18,"openAccess":18,"references":18,"isForceReanalyzing":188},"aaf8bc2a-b91a-411c-849b-6d1b50260da9","2024-02-06T17:30:38.037+00:00","2024-12-07T23:26:07.721+00:00",[],"Minimum-cycle-factors-in-quasi-transitive-digraphs",{"references":959,"title":961,"doi":963},{"VOID":960},"Bang-Jensen, 2001\nBang-Jensen, 1998, A polynomial algorithm for the hamiltonian cycle problem in semicomplete multipartite digraphs, J. Graph Theory, 29, 111, 10.1002\u002F(SICI)1097-0118(199810)29:2\u003C111::AID-JGT7>3.0.CO;2-U\nBang-Jensen, 2006, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, Discrete Optim., 3, 86, 10.1016\u002Fj.disopt.2005.11.001\nBang-Jensen, 2005, Finding complementary cycles in locally semicomplete digraphs, Discrete Appl. Math., 146, 245, 10.1016\u002Fj.dam.2004.10.002\nBang-Jensen, 1995, Quasi-transitive digraphs, J. Graph Theory, 20, 141, 10.1002\u002Fjgt.3190200205\nBang-Jensen, 2003, Strongly connected spanning subgraphs with the minimum number of arcs in quasi-transitive digraphs, SIAM J. Discrete Math., 16, 335, 10.1137\u002FS0895480199354220\nGuo, 1994, On complementary cycles in locally semicomplete digraphs, Discrete Math., 135, 121, 10.1016\u002F0012-365X(93)E0099-P\nGutin, 1988, Characterization of complete n-partite digraphs that have a hamiltonian path, Kibernika (Kiev), 1, 107\nGutin, 1984, Criterion for complete bipartite digraphs to be hamiltonian, Vestsī Akad. Navuk BSSR Ser. Fīz.-Mat. Navuk, 1, 109\nGutin, 1994, Polynomial algorithms for finding paths and cycles in quasi-transitive digraphs, Australas. J. Combin., 10, 231\nGutin, 1995, Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, Discrete Math., 141, 153, 10.1016\u002F0012-365X(93)E0195-A\nH. Li, J. Shu, The partition of a strong tournament, Rapport de Recherce No. 1306, LRI Universite Paris SUD, 2002\nReid, 1985, Two complementary circuits in two-connected tournaments, vol. 27, 321\nSong, 1993, Complementary cycles of all lengths in tournaments, J. Combin. Theory Ser. B, 57, 18, 10.1006\u002Fjctb.1993.1002",{"EN":962},"Minimum cycle factors in quasi-transitive digraphs",{"VOID":964},"10.1016\u002Fj.disopt.2007.12.002","https:\u002F\u002Fwww.sciencedirect.com\u002Fscience\u002Farticle\u002Fpii\u002FS1572528607000825",[967,982],{"id":968,"sortIndex":19,"researcher":18,"roles":969,"affiliations":970,"properties":979},"2fd28e07-e9da-4cb3-9846-ecc6aafd9f44",[128],[971],{"id":18,"sortIndex":19,"affiliation":972,"properties":18},{"id":973,"createTime":974,"updateTime":974,"relativeEntities":975,"slug":18,"properties":976,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"be3dcc1d-ba9a-4dc0-be3e-fc4a49eb5393","2024-01-10T19:02:00.362+00:00",[],{"title":977},{"VI":978},"Department of Mathematics and Computer Science, University of Southern Denmark, DK-5230, Odense, Denmark",{"title":980},{"VI":981},"Jørgen Bang-Jensen",{"id":983,"sortIndex":126,"researcher":18,"roles":984,"affiliations":985,"properties":994},"91d1cae0-4fdf-4f54-9897-06510b8e15cb",[128],[986],{"id":18,"sortIndex":19,"affiliation":987,"properties":18},{"id":988,"createTime":989,"updateTime":989,"relativeEntities":990,"slug":18,"properties":991,"entityType":54,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19},"40a5a31f-113f-450f-a59e-d08f83b327fe","2023-12-07T22:03:45.130+00:00",[],{"title":992},{"VI":993},"Department of Mathematics and Statistics, University of Winnipeg, Winnipeg, MB, Canada",{"title":995},{"VI":996},"Morten Hegner Nielsen",{"url":965,"publisher":998,"properties":1020},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":999,"slug":10,"properties":1000,"entityType":16,"verifyStatus":17,"verifyTime":18,"verifyNote":18,"syncStatus":17,"languages":18,"translateLanguages":18,"viewCount":19,"subjectFields":1003,"manageAffiliations":1004,"indexDatabases":1005,"url":18,"thumbnailPath":18,"statistic":18,"gsStatistic":18,"type":18,"analyzePriority":18},[],{"issn":1001,"title":1002},{"VOID":13},{"EN":15},[],[],[1006,1013],{"id":59,"indexDatabase":1007,"url":72,"indexYears":73,"academicFieldIds":1012,"indexDatabaseRanking":78},{"id":61,"createTime":62,"updateTime":63,"relativeEntities":1008,"label":1009,"description":1010,"key":69,"publicationTags":1011,"standard":18},[],{"EN":66,"VI":66},{"EN":66,"VI":68},[71],[75,76,77],{"id":80,"indexDatabase":1014,"url":95,"indexYears":18,"academicFieldIds":1019,"indexDatabaseRanking":18},{"id":82,"createTime":83,"updateTime":84,"relativeEntities":1015,"label":1016,"description":1017,"key":91,"publicationTags":1018,"standard":18},[],{"EN":87,"VI":87},{"VI":89,"EN":90},[93,94],[97,98],{"volume":1021,"pages":1022},{"VOID":866},{"VOID":1023},"121-137"]