{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:17:52Z","timestamp":1774973872378,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,12]],"date-time":"2013-01-12T00:00:00Z","timestamp":1357948800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10601-012-9136-9","type":"journal-article","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:55:53Z","timestamp":1357872953000},"page":"166-201","source":"Crossref","is-referenced-by-count":9,"title":["Using dual presolving reductions to reformulate cumulative constraints"],"prefix":"10.1007","volume":"18","author":[{"given":"Stefan","family":"Heinz","sequence":"first","affiliation":[]},{"given":"Jens","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,12]]},"reference":[{"key":"9136_CR1","unstructured":"Achterberg, T. (2007). Constraint integer programming. PhD thesis, Technische Universit\u00e4t Berlin."},{"issue":"1","key":"9136_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: Solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341.","journal-title":"Mathematical Programming Computation"},{"issue":"7","key":"9136_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N. (1993). Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"key":"9136_CR4","doi-asserted-by":"crossref","unstructured":"Artigues, C., Demassey, S., N\u00e9ron, E., (eds.) (2008). Resource-constrained project scheduling: Models, algorithms, extensions and applications. iSTE","DOI":"10.1002\/9780470611227"},{"issue":"1\u20132","key":"9136_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., & Pape, C.L. (2000). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints, 5(1\u20132), 119\u2013139.","journal-title":"Constraints"},{"key":"9136_CR6","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W. (2001). Constraint-based scheduling. Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"1","key":"9136_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.disopt.2004.12.003","volume":"2","author":"P Baptiste","year":"2005","unstructured":"Baptiste, P., & Pape, C.L. (2005). Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization, 2(1), 83\u201399.","journal-title":"Discrete Optimization"},{"key":"9136_CR8","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., L\u00fcbbecke, M.E., M\u00f6hring, R.H., Schulz, J. (2010). A constraint integer programming approach for resource-constrained project scheduling. In Lodi, A., Milano, M., Toth, P., (eds.) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (vol. 6140, pp. 313\u2013317) of LNCS. Springer.","DOI":"10.1007\/978-3-642-13520-0_34"},{"key":"9136_CR9","doi-asserted-by":"crossref","unstructured":"Berthold, T., Heinz, S., Schulz, J. (2011). An approximative criterion for the potential of energetic reasoning. In Marchetti-Spaccamela, A., Segal, M., (eds.) Theory and Practice of Algorithms in (Computer) systems (vol. 6595, pp. 229\u2013239) of LNCS. Springer.","DOI":"10.1007\/978-3-642-19754-3_23"},{"issue":"1","key":"9136_CR10","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-6377(87)90004-6","volume":"6","author":"RE Bixby","year":"1987","unstructured":"Bixby, R.E., & Wagner, D.K. (1987). A note on detecting simple redundancies in linear systems. Operation Research Letters, 6(1), 15\u201317.","journal-title":"Operation Research Letters"},{"issue":"1","key":"9136_CR11","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1613\/jair.2538","volume":"32","author":"L Bordeaux","year":"2008","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T. (2008). A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit. Journal of Artificial Intelligence Research, 32(1), 607\u2013629.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"9136_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1011432307724","volume":"6","author":"JE Borrett","year":"2001","unstructured":"Borrett, J.E., & Tsang, E.P.K. (2001). A context for constraint satisfaction problem formulation selection. Constraints, 6(4), 299\u2013327.","journal-title":"Constraints"},{"key":"9136_CR13","doi-asserted-by":"crossref","unstructured":"Chu, G., & Stuckey, P.J. (2012). A generic method for identifying and exploiting dominance relations. In Milano, M., (ed.) Principles and practice of constraint programming - CP 2012 (vol. 7514, pp. 6\u201322) of LNCS.","DOI":"10.1007\/978-3-642-33558-7_4"},{"key":"9136_CR14","unstructured":"Dantzig, G.B., & Thapa, M.N. (2003). Linear programming 2. Springer Series in Operations Research. Springer."},{"key":"9136_CR15","doi-asserted-by":"crossref","unstructured":"de la Banda, M.J.G., Marriott, K., Rafeh, R., Wallace, M. (2006). The modelling language Zinc. In Benhamou, F., (ed.) Principles and practice of constraint programming - CP 2006 (vol. 4204, pp. 700\u2013705). LNCS.","DOI":"10.1007\/11889205_54"},{"key":"9136_CR16","unstructured":"Dechter, R. (2003). Constraint processing. Elsevier Morgan Kaufmann."},{"key":"9136_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I. (2008). ESSENCE: A constraint language for specifying combinatorial problems. Constraints, 13, 268\u2013306.","journal-title":"Constraints"},{"key":"9136_CR18","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.F. (2006). Symmetry in constraint programming. In Handbooks of constraint programming. Elsevier.","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"9136_CR19","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Miguel, I., Rendl, A. (2007). Tailoring solver-independent constraint models: a case study with ESSENCE and MINION. In Miguel, I., Ruml, W., (eds.) Abstraction, Reformulation, and Approximation (vol. 4612, pp. 184\u2013199) of LNCS.","DOI":"10.1007\/978-3-540-73580-9_16"},{"key":"9136_CR20","unstructured":"Guzelsoy, M. (2010). Dual methods in mixed integer linear programming. PhD thesis, Lehigh University,Industrial and Systems Engineering."},{"key":"9136_CR21","doi-asserted-by":"crossref","unstructured":"Heinz, S., & Schulz, J. (2011). Explanations for the cumulative constraint: An experimental study. In Pardalos, P.M., Rebennack, S. (eds.) Experimental algorithms (vol. 6630, pp. 400\u2013409) of LNCS. Springer.","DOI":"10.1007\/978-3-642-20662-7_34"},{"issue":"1\u20132","key":"9136_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF02284625","volume":"17","author":"JL Imbert","year":"1996","unstructured":"Imbert, J.L., & Hentenryck, P.V. (1996). Redundancy elimination with a lexicographic solved form. Annals of Mathematics and Artificial Intelligence, 17(1\u20132), 85\u2013106.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9136_CR23","doi-asserted-by":"crossref","unstructured":"Karwan, M.H., Lotfi, V., Telgen, J., Zionts, S. (1983). Redundancy in mathematical programming. A state-of-the-art survey. Volume 206 of Lecture Notes in Economics and Mathematical Systems. Springer.","DOI":"10.1007\/978-3-642-45535-3"},{"key":"9136_CR24","first-page":"167","volume":"17","author":"Z Kiziltan","year":"2004","unstructured":"Kiziltan, Z. (2004). Symmetry breaking ordering constraints: Thesis. AI Communications, 17, 167\u2013169.","journal-title":"AI Communications"},{"issue":"2","key":"9136_CR25","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R Klein","year":"1999","unstructured":"Klein, R., & Scholl, A. (1999). Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 112(2), 322\u2013346.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"9136_CR26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K. (2011). MIPLIB 2010. Mathematical Programming Computation, 3(2), 103\u2013163.","journal-title":"Mathematical Programming Computation"},{"issue":"1","key":"9136_CR27","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"JL Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.L. (1978). A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10(1), 29\u2013127.","journal-title":"Artificial Intelligence"},{"key":"9136_CR28","unstructured":"Mahajan, A. (2010). Presolving mixed-integer linear programs. Preprint ANL\/MCS-P1752-0510, Mathematics and Computer Science Division."},{"issue":"3","key":"9136_CR29","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10601-008-9041-4","volume":"13","author":"K Marriott","year":"2008","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P.J., de\u00a0la Banda, M.G., Wallace, M. (2008). The design of the zinc modelling language. Constraints, 13(3), 229\u2013267.","journal-title":"Constraints"},{"issue":"3","key":"9136_CR30","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"RH M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Stork, F., Uetz, M. (2003). Solving project scheduling problems by minimum cut computations. Management Science, 49(3), 330\u2013350.","journal-title":"Management Science"},{"key":"9136_CR31","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In Bessiere, C., (ed.) Principles and Practice of Constraint Programming - CP 2007 (vol. 4741, pp. 529\u2013543) of LNCS. Springer.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9136_CR32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C., Zanarini, A. (2012). Counting-based search: Branching heuristics for constraint satisfaction problems. Journal of Artificial Intelligence Research, 43, 173\u2013210.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9136_CR33","unstructured":"Prestwich, S.D., & Beck, J.C. (2004). Exploiting dominance in three symmetric problems. In Proceedings of the fourth international workshop on symmetry and constraint satisfaction problems."},{"key":"9136_CR34","unstructured":"PSPLib: Project scheduling problem library. http:\/\/129.187.106.231\/psplib\/ ."},{"key":"9136_CR35","doi-asserted-by":"crossref","unstructured":"Puget, J.F. (2005). Automatic detection of variable and value symmetries. In van Beek, P. (ed.) Principles and practice of constraint programming - CP 2005 (vol. 3709, pp. 475\u2013489) of LNCS.","DOI":"10.1007\/11564751_36"},{"key":"9136_CR36","unstructured":"Rendl, A. (2010). Effective compilation of constraint models. PhD thesis, University of St Andrews."},{"key":"9136_CR37","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MWP Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.P. (1994). Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing, 6, 445\u2013454.","journal-title":"ORSA Journal on Computing"},{"key":"9136_CR38","doi-asserted-by":"crossref","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G. (2012). Solving rcpsp\/max by lazy clause generation. Journal of Scheduling. (accepted).","DOI":"10.1007\/s10951-012-0285-x"},{"key":"9136_CR39","unstructured":"van Hoeve, W.J. (2001). The all different constraint: A survey. CoRR cs.PL\/0105015."},{"key":"9136_CR40","doi-asserted-by":"crossref","unstructured":"Vil\u00edm, P. (2009). Max energy filtering algorithm for discrete cumulative resources. In van Hoeve, W.J., Hooker, J.N. (eds.) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (vol. 5547, pp. 294\u2013308) of LNCS.","DOI":"10.1007\/978-3-642-01929-6_22"},{"issue":"2","key":"9136_CR41","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.1090.0733","volume":"58","author":"T Yunes","year":"2010","unstructured":"Yunes, T., Aron, I.D., Hooker, J.N. (2010). An integrated solver for optimization problems. Operations Research, 58(2), 342\u2013356.","journal-title":"Operations Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9136-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-012-9136-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-012-9136-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T05:29:22Z","timestamp":1562563762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-012-9136-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,12]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9136"],"URL":"https:\/\/doi.org\/10.1007\/s10601-012-9136-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,12]]}}}