You are here:

KEYWORDS \ LABEL \ IMPLICIT ENUMERATION ALGORITHM

Search for Keywords:

Use Fulltext Search

Please enter at least 3 characters or change search options

Search Options

Position of search string:

Anywhere Beginning

Documents 1 - 1 of 1

	Computational experiments with linear progamming oriented implict enumeration algorithms for the solution of linear (0,1)-programs THEMES: Nastansky, Ludwig\...\Operations Res... | Grosse, H. Werner META STRUCTURES: LN\Papers	1975	LABEL: branch&bound algorithm | computational experiments | implicit enumeration algorithm | Mathematical Programming - mixed-integer | TR 440 ORGANIZATIONS: Fachbereich Wirtschaftswissenschaften | Gesamthochschule Paderborn | Universität Karlsruhe | WIOR PEOPLE: Balas, Egon | Grosse, H. Werner | Nastansky, Ludwig PLACES: Paderborn TIME: 1975