Experiments in mixed-integer linear programming

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1971 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 1, pages 76-94 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: Michel Bénichou; Jean-Michel Gauthier; Paul Girodet; Gerard Hentges; Gerard Ribière; O. Vincent;

doi: 10.1007/bf01584074

Experiments in mixed-integer linear programming

- Summary
- Subjects
- Metrics

Abstract

This paper presents a “branch and bound” method for solving mixed integer linear programming problems. After briefly discussing the bases of the method, new concepts called pseudo-costs and estimations are introduced. Then, the heuristic rules for generating the tree, which are the main features of the method, are presented. Numerous parameters allow the user for adjusting the search strategy to a given problem.

Related Organizations

IBM (United States)
United States
IBM (France)
France

Keywords

Mixed integer programming, Linear programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	185
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%