{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:10Z","timestamp":1747548310576},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0166-218x(93)90049-t","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T11:06:34Z","timestamp":1034334394000},"page":"257-269","source":"Crossref","is-referenced-by-count":18,"title":["Lagrangean methods for 0\u20131 quadratic problems"],"prefix":"10.1016","volume":"42","author":[{"given":"Philippe","family":"Michelon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Maculan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90049-T_BIB1","series-title":"Non linear Programming: Theory and Algorithms","author":"Bazara","year":"1979"},{"key":"10.1016\/0166-218X(93)90049-T_BIB2","series-title":"Pr\u00e9publication 89-3 s\u00e9rie Informatique","article-title":"Les probl\u00e8mes d'allocation de ressources dans les syst\u00e8mes distribu\u00e9s (synth\u00e8se)","author":"Benhamamouch","year":"1989"},{"key":"10.1016\/0166-218X(93)90049-T_BIB3","article-title":"Best network flow bounds for the quadratic knap-sack problem","author":"Chaillou","year":"1983","journal-title":"The Network International Workshop"},{"key":"10.1016\/0166-218X(93)90049-T_BIB4","first-page":"12","article-title":"Lagrangean relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(93)90049-T_BIB5","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1979"},{"key":"10.1016\/0166-218X(93)90049-T_BIB6","series-title":"Lagrangean decomposition for integer programming problems with multiple subsets of linear constraints and nonlinear objective function","author":"Guignard","year":"1989"},{"key":"10.1016\/0166-218X(93)90049-T_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","article-title":"Lagrangean decomposition: A model yielding stronger Lagrangean bounds","volume":"32","author":"Guignard","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(93)90049-T_BIB8","first-page":"53","article-title":"Method of nonlinear 0\u20131 programming","volume":"5","author":"Hansen","year":"1979"},{"key":"10.1016\/0166-218X(93)90049-T_BIB9","unstructured":"P. Michelon, M\u00e9thodes Lagrangiennes pour programmation lin\u00e9aire avec variables enti\u00e8res, publication #706, DIRO, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9.; also: Investigaci\u00f3n Oper., to appear."},{"key":"10.1016\/0166-218X(93)90049-T_BIB10","unstructured":"P. Michelon and N. Maculan, Lagrangean decomposition for nonlinear integer programming, Math. Programming Ser. B., to appear."},{"key":"10.1016\/0166-218X(93)90049-T_BIB11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","article-title":"Minimum costs and related problems","volume":"5","author":"Picard","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90049-T_BIB12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1051\/ro\/1987210403251","article-title":"Probl\u00e8me de la bipartition minimale d'un graphe","volume":"21","author":"Roucairol","year":"1987","journal-title":"RAIRO"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390049T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390049T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:29:13Z","timestamp":1555180153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390049T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0166218X9390049T"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90049-t","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}