Auflistung: nach Autor BRUCKER, P


Oder wählen Sie unten einen Buchstaben aus, um nach Nachnamen zu suchen
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
1 bis 20 von 24 Treffer  nächste >
ErscheinungsdatumTitelAutor(en)
1994A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEMBRUCKER, P; JURISCH, B; SIEVERS, B
1995A MONGE PROPERTY FOR THE D-DIMENSIONAL TRANSPORTATION PROBLEMBEIN, WW; BRUCKER, P; PARK, JK; PATHAK, PK
1993A NEW LOWER BOUND FOR THE JOB-SHOP SCHEDULING PROBLEMBRUCKER, P; JURISCH, B
1994A POLYNOMIAL ALGORITHM FOR THE 2 MACHINE JOB-SHOP SCHEDULING PROBLEM WITH A FIXED NUMBER OF JOBSBRUCKER, P
1988AN EFFICIENT ALGORITHM FOR THE JOB-SHOP PROBLEM WITH 2 JOBSBRUCKER, P
1984AN O(N) ALGORITHM FOR QUADRATIC KNAPSACK-PROBLEMSBRUCKER, P
1989AN O(NLOGN)-ALGORITHM FOR SOLVING A SPECIAL-CLASS OF LINEAR-PROGRAMSBEIN, W; BRUCKER, P
1984AN O(NLOGN)-ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM IN TREESBRUCKER, P
1985AN OUT-OF-KILTER METHOD FOR THE ALGEBRAIC CIRCULATION PROBLEMBRUCKER, P; PAPENJOHANN, W
1987APPROXIMATION OF A SET OF POINTS BY POINTS OF A GRIDBRUCKER, P; MEYER, W
1990CYCLIC SCHEDULES FOR R-IRREGULARLY OCCURRING EVENTSBRUCKER, P; BURKARD, RE; HURINK, J
1995EFFICIENT ALGORITHMS FOR SOME PATH PARTITIONING PROBLEMSBRUCKER, P
1986GREEDY CONCEPTS FOR NETWORK FLOW PROBLEMSBEIN, WW; BRUCKER, P
1992JOB-SHOP (C-CODES)BRUCKER, P; JURISCH, B; SIEVERS, B
1990JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINESBRUCKER, P; SCHLIE, R
1981MINIMIZING MAXIMUM LATENESS IN A 2-MACHINE UNIT-TIME JOB SHOPBRUCKER, P
1985MINIMUM COST FLOW ALGORITHMS FOR SERIES-PARALLEL NETWORKSBEIN, WW; BRUCKER, P; TAMIR, A
1988SCHEDULING 2 IRREGULAR POLYGONSBRUCKER, P; MEYER, W
1993SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBSBRUCKER, P; JURISCH, B; TAUTENHAHN, T; WERNER, F
1993SERIES-PARALLEL COMPOSITION OF GREEDY LINEAR-PROGRAMMING PROBLEMSBEIN, WW; BRUCKER, P; HOFFMAN, AJ
1 bis 20 von 24 Treffer  nächste >