{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:09:16Z","timestamp":1773324556765,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1977,12]]},"DOI":"10.1007\/bf01593767","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"26-47","source":"Crossref","is-referenced-by-count":62,"title":["Experiments in mixed-integer linear programming using pseudo-costs"],"prefix":"10.1007","volume":"12","author":[{"given":"J. -M.","family":"Gauthier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Ribi\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"450","volume":"2","author":"E.M.L. Beale","year":"1966","unstructured":"E.M.L. Beale and R.E. Small, \u201cMixed integer programming by a branch and bound technique\u201d, in: W.H. Kalenich, ed.,Proceedings of the IFIP congress 65, Vol. 2 (1966) pp. 450\u2013451.","journal-title":"Proceedings of the IFIP congress 65"},{"key":"CR2","unstructured":"E.M.L. Beale and J.A. Tomlin,\u201d Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables\u201d, in:Proceedings of the 5th IFORS conference 1969 (Tavistock Publications London)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. B\u00e9nichou","year":"1971","unstructured":"M. B\u00e9nichou, J.M. Gauthier, P. Girodet, G. Hentges, G. Ribi\u00e8re and O. Vincent, \u201cExperiments in mixed-integer linear programming\u201d,Mathematical Programming 1 (1971) 76\u201394.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120687","volume":"2","author":"R. Breu","year":"1974","unstructured":"R. Breu and C.A. Burdet, \u201cBranch and bound experiments in 0\u20131 programming\u201d,Mathematical Programming Study 2 (1974) 1\u201350.","journal-title":"Mathematical Programming Study"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"R.J. Dakin, \u201cA tree search algorithm for mixed integer programming problems\u201d,The Computer Journal 8 (1965) 250\u2013255.","journal-title":"The Computer Journal"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.12.7.576","volume":"12","author":"N.J. Driebeek","year":"1966","unstructured":"N.J. Driebeek, \u201cAn algorithm for the solution of mixed integer programming problems\u201d,Management Science 12 (1966) 576\u2013587.","journal-title":"Management Science"},{"issue":"3","key":"CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01584548","volume":"2","author":"J.J.H. Forrest","year":"1972","unstructured":"J.J.H. Forrest and J.A. Tomlin, \u201cUpdated triangular factors of the basis to maintain sparsity in the product form simplex method\u201d,Mathematical Programming 2 (3) (1972) 263\u2013278.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"J.J.H. Forrest, J.P. Hirst and J.A. Tomlin, \u201cPractical solution of large mixed integer programming problems with UMPIRE\u201d,Management Science 20 (5) (1974).","DOI":"10.1287\/mnsc.20.5.736"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A.M. Geoffrion and R.E. Marsten, \u201cInteger programming algorithms: a framework and state-of-the-art-survey\u201d in: A.M. Geoffrion, ed.,Perspectives on optimization (Addison-Wesley, 1972).","DOI":"10.1287\/mnsc.18.9.465"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"Paula Harris","year":"1973","unstructured":"Paula Harris, \u201cPivot selection methods of the devex LP Code\u201d,Mathematical Programming 5 (1973) 1\u201328 [Also:Mathematical Programming Study 4 (1975) 30\u201357.]","journal-title":"Mathematical Programming"},{"key":"CR11","first-page":"1","volume":"6","author":"P. Herve","year":"1970","unstructured":"P. Herve, \u201cR\u00e9solution des programmes lin\u00e9aires \u00e0 variables mixtes par la proc\u00e9dure SEP\u201d,METRA 6 (19 ) 1\u201367.","journal-title":"METRA"},{"key":"CR12","unstructured":"IBM Mathematical Programming System Extended\/370 (MPSX\/370): Mixed Integer Programming\/370(MIP\/370) Program Reference Manual, SH19-1099 (December 1974)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"A.H. Land and A.G. Doig, \u201cAn automatic method of solving discrete programming problems\u201d,Econometrica 28 (1960) 497\u2013520.","journal-title":"Econometrica"},{"key":"CR14","unstructured":"C.E. Lemke and Kurt Spielberg, \u201cDirect search zero\u2013one and mixed integer programming\u201d, Report L3, IBM Data Processing Division, New York Scientific Center (1966)."},{"key":"CR15","unstructured":"G. Mitra, \u201cDesigning branch and bound algorithms for mathematical programming\u201d,7th international symposium on mathematical programming, 1970, The Hague, Holland."},{"key":"CR16","unstructured":"B. Roy, R. Benayoun and J. Tergny, \u201cDe la proc\u00e9dure SEP au programme Oph\u00e9lie mixte\u201d,SEMA (1969)."},{"key":"CR17","unstructured":"R. Shareshian and K. Spielberg, \u201cOn integer and mixed integer programming and related areas in mathematical programming\u201d, IBM N.Y. Scientific Center (1966)."},{"key":"CR18","unstructured":"J.A. Tomlin, \u201cBranch and bound method for integer and non-convex programming\u201d, in: J. Abadie, ed.,Integer and nonlinear programming (North-Holland, 1970)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF01580221","volume":"6","author":"J.A. Tomlin","year":"1974","unstructured":"J.A. Tomlin, \u201cOn pricing and backward transformation in linear programming\u201d,Mathematical Programming 6 (1974) 42\u201347.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593767\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:02Z","timestamp":1556898482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593767"],"URL":"https:\/\/doi.org\/10.1007\/bf01593767","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}