Home
Research/Projects
Community/Contact
Knowledge-Pool
Search
Nastansky, Ludwig; Grosse, H. Werner: Computational experiments with linear progamming oriented implict enumeration algorithms for the solution of linear (0,1)-programs, FB Wrtschaftswissenschaft, Universität Paderborn, Working Paper #1-1975, Paderborn, Oktober 1975, pp. 30.
Traditionally, enumerative algorithms for solving linear (o,1)-programs can be classified into the groups of implicit enumeration algorithms and branch-and-bound algorithms. While the first group algorithmically is based more on local inspection procedures which tend to be easily understood in term...
THEMES:
Nastansky, Ludwig\...\Operations Res...
|
Grosse, H. Werner
META STRUCTURES:
LN\Papers
YEAR:
1975
PERM. URL:
http://gcc.upb.de/K-Pool/ImplicitEnumeration
Login
User: Anonymous
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
Comments/attachments: Close
Open
Weitere Details:
AP-1_FB-WiWi_GH-PB_Nastansky-Grosse-1975.pdf
1.5 MB