{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T12:36:30Z","timestamp":1762173390494,"version":"3.41.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":["Constraints"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1023\/a:1009874519069","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T18:53:29Z","timestamp":1040583209000},"page":"141-160","source":"Crossref","is-referenced-by-count":4,"title":["Solving Various Weighted Matching Problems with Constraints"],"prefix":"10.1007","volume":"5","author":[{"given":"Yves","family":"Caseau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francois","family":"Laburthe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"243797_CR1","doi-asserted-by":"crossref","unstructured":"Busaker R.G., Gowen P.J. (1961). A Procedure for Determining a Family of Minimal Cost Network Flow Patterns, O.R.O. Technical Report 15, Johns Hopkins University.","DOI":"10.21236\/AD0249662"},{"key":"243797_CR2","doi-asserted-by":"crossref","unstructured":"Caseau Y., Guillo P.-Y., Levenez E. (1993). A Deductive and Object-Oriented Approach to a Complex Scheduling Problem. Proc. of DOOD'93, Phoenix.","DOI":"10.1007\/3-540-57530-8_5"},{"key":"243797_CR3","unstructured":"CaseauY., Laburthe F. (1994). Improved CLP Scheduling with Tasks Intervals. Proc. of the 11th International Conference on Logic Programming, P. Van Hentenryck ed., The MIT Press."},{"key":"243797_CR4","unstructured":"Caseau Y., Laburthe F. (1996). Cumulative Scheduling with Task Intervals. Proc. of the Joint International Conference and Symposium on Logic Programming, M. Maher ed., The MIT Press."},{"key":"243797_CR5","doi-asserted-by":"crossref","unstructured":"Caseau Y., Laburthe F. (1997). Solving small TSPs with Constraints. Proc. of the 14th International Conference on Logic Programming, L. Naish ed., The MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"243797_CR6","unstructured":"Cormen T., Leiserson C., Rivest R. (1986). Introduction to Algorithms. The MIT Press."},{"key":"243797_CR7","doi-asserted-by":"crossref","unstructured":"Ford L.R., Fulkerson D.R. (1956). Maximal Flow through a Network, Candidan Journal of Mathematics, p. 399.","DOI":"10.4153\/CJM-1956-045-5"},{"issue":"1-3","key":"243797_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. Freuder","year":"1992","unstructured":"Freuder E., Wallace R. (1992). Partial Constraint Satisfaction, Artificial Intelligence, 58 (1-3), p. 21-70.","journal-title":"Artificial Intelligence"},{"key":"243797_CR9","unstructured":"Gerards B. (1994). Matching. in Handbook in Operations Research and Management Science (Networks) eds. M.O. Ball et al."},{"key":"243797_CR10","unstructured":"Gondran M., Minoux M. (1984). Graphes and Algorithmes. Eyrolles, 1979 (french) and J. Wiley."},{"key":"243797_CR11","doi-asserted-by":"crossref","unstructured":"Gabow H.N., Tarjan R.E. (1989). Faster Scaling algorithms for network problems. SIAM Journal of Computing","DOI":"10.1137\/0218069"},{"key":"243797_CR12","volume-title":"Concurrence et Coop\u00b4eration de Mod`eles Multiples","author":"J. Jourdan","year":"1995","unstructured":"Jourdan J. (1995). Concurrence et Coop\u00b4eration de Mod`eles Multiples. Ph. D. Thesis (french), Paris VII University, France."},{"key":"243797_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn H.W. (1955). The Hungarian Method for the Assignment Problem, Naval Research Quarterly 2, p. 83.","journal-title":"Naval Research Quarterly"},{"key":"243797_CR14","unstructured":"Laburthe F. (1998). Constraints and Algorithms for Combinatorial Optimization, unpublished PhD. Thesis, University of Paris 7."},{"key":"243797_CR15","series-title":"Research Report ATS 98-2","volume-title":"Eclair: a Library of Constraints for Finite Domains","author":"F. Laburthe","year":"1998","unstructured":"Laburthe F., Sav\u00e9ant P., De Givry S., Jourdan J. (1998). Eclair: a Library of Constraints for Finite Domains, Research Report ATS 98-2, Thomson-CSF Corporate Research Laboratory, Orsay, France."},{"key":"243797_CR16","doi-asserted-by":"crossref","unstructured":"Mackworth A.K. (1977). Consistency in networks of relations. Artificial Intelligence, 8.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"243797_CR17","doi-asserted-by":"crossref","unstructured":"Mohr R., Massini G. (1988). Running Efficiently Arc Consistency, Syntactic and Structural Pattern Recognition. Springer Verlag.","DOI":"10.1007\/978-3-642-83462-2_14"},{"key":"243797_CR18","unstructured":"Papadimitrou C., Steiglitz K. (1991). Combinatorial Optimization. Prentice Hall."},{"key":"243797_CR19","unstructured":"R\u00e9gin, J.C. (1994). A Filtering Algorithm for Constraints of Difference in CSPs Proc. of AAAI."},{"key":"243797_CR20","unstructured":"Reeves C. (1993). Modern Heuristic techniques for combinatorial problems. Halsted Press."},{"key":"243797_CR21","unstructured":"Van Hentenryck P. (1989). Constraint Satisfaction in Logic Programming. The MIT Press."},{"key":"243797_CR22","doi-asserted-by":"crossref","unstructured":"van Leuwen J. (1990). Graph Algorithms. in Handbook of Theoretical Computer Science, Elsevier Science Publishers.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009874519069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009874519069\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009874519069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:55:01Z","timestamp":1752378901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009874519069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["243797"],"URL":"https:\/\/doi.org\/10.1023\/a:1009874519069","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}