{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:55:48Z","timestamp":1775624148685,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0012-365x(98)00213-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"229-237","source":"Crossref","is-referenced-by-count":233,"title":["Stabilized column generation"],"prefix":"10.1016","volume":"194","author":[{"given":"Olivier","family":"du Merle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Villeneuve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Desrosiers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00213-1_BIB1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","article-title":"A note on solving large p-median problems","volume":"21","author":"Beasley","year":"1985","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numer. Math."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB3","article-title":"Improvements and comparison of heuristics for solving the multisource Weber problem","author":"Brimberg","year":"1997","journal-title":"Les Cahiers du GERAD G-97-37"},{"issue":"4","key":"10.1016\/S0012-365X(98)00213-1_BIB4","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1287\/opre.46.4.548","article-title":"Solution of the multisource Weber and conditional Weber problems by d.-c. programming","volume":"46","author":"Chen","year":"1998","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB5","doi-asserted-by":"crossref","first-page":"767","DOI":"10.2307\/1911818","article-title":"The decomposition algorithm for linear programming","volume":"29","author":"Dantzig","year":"1961","journal-title":"Econometrica"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0377-2217(96)00195-6","article-title":"Crew pairing at Air France","volume":"97","author":"Desaulniers","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB7","series-title":"Proc. 7th Internat. Workshop on Computer-Aided Scheduling of Public Transport","article-title":"Crew pairing for a regional carrier","author":"Desaulniers","year":"1997"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.25.3.183","article-title":"The facility location problem with limited distances","volume":"25","author":"Drezner","year":"1991","journal-title":"Transportation Sci."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/trsc.8.3.217","article-title":"An algorithm for the M-median plant location problem","volume":"8","author":"Garfinkel","year":"1974","journal-title":"Transportation Sci."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0927-0507(89)01004-2","article-title":"Constrained nonlinear programming","volume":"vol. 21","author":"Gill","year":"1989","journal-title":"Handbooks in Operations Research and Management Science"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB11","unstructured":"P. Hansen, B. Jaumard, S. Krau, O. du Merle, A stabilized column generation algorithm for the multisource Weber problem, Les Cahiers du GERAD, Montr\u00e9al, Canada, 1998, in preparation."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB12","series-title":"Proc. 2nd Internat. Conf. on Metaheuristics \u2014 MIC97","article-title":"An introduction to variable neighborhood search, Les Cahiers du GERAD G-97-51","author":"Hansen","year":"1998"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB13","series-title":"Les Cahiers du GERAD G-97-39","article-title":"Variable neighborhood search for the p-median","author":"Hansen","year":"1998"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB14","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1287\/opre.33.6.1251","article-title":"The minisum and minimax location problems revisited","volume":"33","author":"Hansen","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB15","series-title":"A Series of Comprehensive Studies in Mathematics","article-title":"Convex analysis and minimization algorithms II: advanced theory and bundle methods","author":"Hiriart-Utruty","year":"1993"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB16","first-page":"703","article-title":"The cutting-plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. SIAM"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB17","article-title":"Extensions du probl\u00e8me de Weber","author":"Krau","year":"1997"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB18","series-title":"Optimization Theory for Large Systems","author":"Lasdon","year":"1970"},{"issue":"3","key":"10.1016\/S0012-365X(98)00213-1_BIB19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","article-title":"The boxstep method for large-scale optimization","volume":"23","author":"Marsten","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB20","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB21","volume":"vol. 1","author":"Nemhauser","year":"1989"},{"key":"10.1016\/S0012-365X(98)00213-1_BIB22","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/0377-2217(92)90072-H","article-title":"An optimal method for solving the (generalized) multi-Weber problem","volume":"58","author":"Rosing","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0012-365X(98)00213-1_BIB23","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","article-title":"Interior Point Algorithms: Theory and Analysis","author":"Ye","year":"1997"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98002131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98002131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:54:45Z","timestamp":1556117685000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98002131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0012365X98002131"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00213-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}