ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Improved penalty calculations for a mixed integer branch-and-bound algorithm (1974)

Armstrong, Ronald D. ; Sinha, Prabhakant

Springer

Mathematical programming 6 (1974), S. 212-223

add to mindlist on the mindlist

Details

ISSN: 1436-4646

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract This paper presents an extension of Tomlin's penalties for the branch-and-bound linear mixed integer programming algorithm of Beale and Small. Penalties which are uniformly stronger are obtained by jointly conditioning on a basic variable and the non-basic variable yielding the Tomlin penalty. It is shown that this penalty can be computed with a little additional arithmetic and some extra bookkeeping. The improvement is easy to incorporate for the normal case as well as when the variables are grouped into ordered sets with generalized upper bounds. Computational experience bears out the usefulness of the extra effort for predominantly integer problems.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01580237

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit