{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:07:11Z","timestamp":1761620831821,"version":"3.40.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1021136801775","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:40:25Z","timestamp":1048207225000},"page":"15-29","source":"Crossref","is-referenced-by-count":7,"title":["Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts"],"prefix":"10.1007","volume":"115","author":[{"given":"Erlendur S.","family":"Thorsteinsson","sequence":"first","affiliation":[]},{"given":"Greger","family":"Ottosson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5101080_CR1","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume-title":"Discrete Optimization II, Vol. 5","author":"E. Balas","year":"1979","unstructured":"E. Balas, Disjunctive programming, in: Discrete Optimization II, Vol. 5, eds. P.L. Hammer, E.L. Johnson and B.H. Korte, Annals of Discrete Mathematics (North-Holland, Amsterdam, 1979) pp. 3-51."},{"key":"5101080_CR2","unstructured":"E.M.L. Beale and J.A. Tomlin, Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables, in: Proceedings of the Fifth International Conference on Operation Research, ed. J. Lawrence (Tavistock Publications, 1970)."},{"key":"5101080_CR3","unstructured":"M. Carlsson et al., SICStus Prolog user's manual, SICS Research Report, Swedish Institute of Computer Science (1995). URL: http:\/\/www.sics.se\/sicstus."},{"key":"5101080_CR4","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"V. Chv\u00e1tal, Linear Programming (Freeman, New York, 1983)."},{"key":"5101080_CR5","unstructured":"Dash Optimization, Inc., XPRESS-MP: User Manuals, Version 12.11 (2000)."},{"key":"5101080_CR6","unstructured":"I.R. de Farias, E.L. Johnson and G.L. Nemhauser, A branch-and-cut approach without binary variables to combinatorial optimization problems with continuous variables and combinatorial constraints, Knowledge Engineering Review (1999) submitted."},{"key":"5101080_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming","author":"F. Focacci","year":"1999","unstructured":"F. Focacci, A. Lodi and M. Milano, Cost-based domain filtering, in: Principles and Practice of Constraint Programming, ed. J. Jaffar, Lecture Notes in Computer Science, Vol. 1713 (Springer, Berlin, 1999)."},{"key":"5101080_CR8","unstructured":"F. Focacci, A. Lodi and M. Milano, Integration of CP and OR methods for matching problems, in: CP-AI-OR'99 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (February 1999)."},{"key":"5101080_CR9","unstructured":"F. Focacci, A. Lodi and M. Milano, Solving TSP with time windows with constraints, in: Sixteenth International Conference on Logic Programming (November 1999)."},{"key":"5101080_CR10","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi, M. Milano and D. Vigo, Solving TSP through the integration of OR and CP techniques, in: CP98Workshop on Large Scale Combinatorial Optimisation and Constraints (October 1998).","DOI":"10.1016\/S1571-0653(04)00002-2"},{"key":"5101080_CR11","series-title":"Orcas Island, Seattle, USA, Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming, PPCP'94, Second International Workshop","author":"J.N. Hooker","year":"1994","unstructured":"J.N. Hooker, Logic-based methods for optimization, in: Principles and Practice of Constraint Programming, PPCP'94, Second International Workshop, ed. A. Borning, Orcas Island, Seattle, USA, Lecture Notes in Computer Science, Vol. 874 (Springer, Berlin, 1994)."},{"issue":"1-3","key":"5101080_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"J.N. Hooker and M.A. Osorio, Mixed logical\/linear programming, Discrete Applied Mathematics 96-97(1-3) (1999) 395-442.","journal-title":"Discrete Applied Mathematics"},{"key":"5101080_CR13","unstructured":"J.N. Hooker, H.-J. Kim and G. Ottosson, A declarative modeling framework that integrates solution methods, Annals of Operations Research (1998) to appear."},{"key":"5101080_CR14","unstructured":"J.N. Hooker, G. Ottosson, E.S. Thorsteinsson and H.-J. Kim, On integrating constraint propagation and linear programming for combinatorial optimization, in: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) (AAAI Press\/MIT Press, 1999) pp. 136-141."},{"issue":"1","key":"5101080_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1017\/S0269888900001077","volume":"15","author":"J.N. Hooker","year":"2000","unstructured":"J.N. Hooker, G. Ottosson, E.S. Thorsteinsson and H.-J. Kim, A scheme for unifying optimization and constraint satisfaction methods, Knowledge Engineering Review 15(1) (2000) 11-30.","journal-title":"Knowledge Engineering Review"},{"key":"5101080_CR16","unstructured":"ILOG, ILOG CPLEX Reference Manual, Version 7.0 (2001)."},{"issue":"2","key":"5101080_CR17","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0377-2217(94)90308-5","volume":"72","author":"G. Mitra","year":"1994","unstructured":"G. Mitra, C. Lucas, S. Moody and E. Hadjiconstantinou, Tools for reformulating logical forms into zero-one mixed integer programs, European Journal of Operational Research 72(2) (1994) 263-277.","journal-title":"European Journal of Operational Research"},{"key":"5101080_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A.Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"5101080_CR19","unstructured":"K. Orsv\u00e4rn and T. Axling, The Tacton view of configuration tasks and engines, in: Workshop on Configuration, Sixteenth National Conference on Artificial Intelligence (AAAI-99) (1999). www.tacton.com, Technical Report WS-99-05."},{"key":"5101080_CR20","doi-asserted-by":"crossref","unstructured":"G. Ottosson, E.S. Thorsteinsson and J.N. Hooker, Mixed global constraints and inference in hybrid CLP-IP solvers, Annals of Mathematics and Artificial Intelligence (March 2001) to appear.","DOI":"10.1016\/S1571-0653(05)80104-0"},{"key":"5101080_CR21","doi-asserted-by":"crossref","unstructured":"P. Refalo, Linear formulation of constraint programming models, in: CP-AI-OR'00 Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (March 2000).","DOI":"10.1007\/3-540-45349-0_27"},{"key":"5101080_CR22","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodo\u0161ek","year":"1999","unstructured":"R. Rodo\u0161ek, M. Wallace and M. Hajian, A new approach to integrating mixed integer programming and constraint logic programming, Annals of Operations Research 86 (1999) 63-87.","journal-title":"Annals of Operations Research"},{"key":"5101080_CR23","unstructured":"Tacton Systems, Tacton Configurator User's Manual (1999). www.tacton.com."},{"key":"5101080_CR24","doi-asserted-by":"crossref","unstructured":"H.P. Williams and H. Yan, Representations of the all_different predicate of constraint satisfaction in integer programming, INFORMS Journal on Computing (2001) to appear.","DOI":"10.1287\/ijoc.13.2.96.10515"},{"key":"5101080_CR25","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"L.A. Wolsey, Integer Programming (Wiley, New York, 1998)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021136801775.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021136801775\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021136801775.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:10:03Z","timestamp":1747577403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021136801775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":25,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5101080"],"URL":"https:\/\/doi.org\/10.1023\/a:1021136801775","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}