AAAAAA
Results: 26-44/44
Authors:
DEINEKO V
RUDOLF R
WOEGINGER GJ
Citation: V. Deineko et al., ON THE RECOGNITION OF PERMUTED SUPNICK AND INCOMPLETE MONGE MATRICES, Acta informatica, 33(6), 1996, pp. 559-569
Authors:
KLINZ B
RUDOLF R
WOEGINGER GJ
Citation: B. Klinz et al., ON THE RECOGNITION OF PERMUTED BOTTLENECK MONGE MATRICES, Discrete applied mathematics, 63(1), 1995, pp. 43-74
Authors:
KLINZ B
RUDOLF R
WOEGINGER GJ
Citation: B. Klinz et al., PERMUTING MATRICES TO AVOID FORBIDDEN SUBMATRICES, Discrete applied mathematics, 60(1-3), 1995, pp. 223-248
Authors:
AUER P
LONG PM
MAASS W
WOEGINGER GJ
Citation: P. Auer et al., ON THE COMPLEXITY OF FUNCTION LEARNING, Machine learning, 18(2-3), 1995, pp. 187-230
Authors:
BURKARD RE
CELA E
WOEGINGER GJ
Citation: Re. Burkard et al., A MINIMAX ASSIGNMENT PROBLEM IN TREE-LIKE COMMUNICATION-NETWORKS, European journal of operational research, 87(3), 1995, pp. 670-684
Authors:
JANSEN K
WOEGINGER GJ
YU ZL
Citation: K. Jansen et al., UET-SCHEDULING WITH CHAIN-TYPE PRECEDENCE CONSTRAINTS, Computers & operations research, 22(9), 1995, pp. 915-920
Authors:
CHEN B
VANVLIET A
WOEGINGER GJ
Citation: B. Chen et al., AN OPTIMAL ALGORITHM FOR PREEMPTIVE ONLINE SCHEDULING, Operations research letters, 18(3), 1995, pp. 127-131
Authors:
WOEGINGER GJ
Citation: Gj. Woeginger, SCHEDULING WITH TIME-DEPENDENT EXECUTION TIMES, Information processing letters, 54(3), 1995, pp. 155-156
Authors:
BODLAENDER HL
JANSEN K
WOEGINGER GJ
Citation: Hl. Bodlaender et al., SCHEDULING WITH INCOMPATIBLE JOBS, Discrete applied mathematics, 55(3), 1994, pp. 219-232
Authors:
BLAZEWICZ J
BURKHARD RE
FINKE G
WOEGINGER GJ
Citation: J. Blazewicz et al., VEHICLE SCHEDULING IN 2-CYCLE FLEXIBLE MANUFACTURING SYSTEMS, Mathematical and computer modelling, 20(2), 1994, pp. 19-31
Authors:
GRABNER PJ
PETHO A
TICHY RF
WOEGINGER GJ
Citation: Pj. Grabner et al., ASSOCIATIVITY OF RECURRENCE MULTIPLICATION, Applied mathematics letters, 7(4), 1994, pp. 85-90
Authors:
WOEGINGER GJ
Citation: Gj. Woeginger, ONLINE SCHEDULING OF JOBS WITH FIXED START AND END TIMES, Theoretical computer science, 130(1), 1994, pp. 5-16
Authors:
PFERSCHY U
RUDOLF R
WOEGINGER GJ
Citation: U. Pferschy et al., MONGE MATRICES MAKE MAXIMIZATION MANAGEABLE, Operations research letters, 16(5), 1994, pp. 245-254
Authors:
CHEN B
VANVLIET A
WOEGINGER GJ
Citation: B. Chen et al., NEW LOWER AND UPPER-BOUNDS FOR ONLINE SCHEDULING, Operations research letters, 16(4), 1994, pp. 221-230
Authors:
BUSSIECK M
HASSLER H
WOEGINGER GJ
ZIMMERMANN UT
Citation: M. Bussieck et al., FAST ALGORITHMS FOR THE MAXIMUM CONVOLUTION PROBLEM, Operations research letters, 15(3), 1994, pp. 133-141
Authors:
CHEN B
VANVLIET A
WOEGINGER GJ
Citation: B. Chen et al., A LOWER-BOUND FOR RANDOMIZED ONLINE SCHEDULING ALGORITHMS, Information processing letters, 51(5), 1994, pp. 219-222
Authors:
DEINEKO V
RUDOLF R
WOEGINGER GJ
Citation: V. Deineko et al., A GENERAL-APPROACH TO AVOIDING 2 BY 2 SUBMATRICES, Computing, 52(4), 1994, pp. 371-388
Authors:
WOEGINGER GJ
Citation: Gj. Woeginger, HEURISTICS FOR PARALLEL MACHINE SCHEDULING WITH DELIVERY TIMES, Acta informatica, 31(6), 1994, pp. 503-512
Authors:
WOEGINGER GJ
Citation: Gj. Woeginger, A NEW ONLINE SCHEDULING HEURISTIC, European journal of operational research, 71(3), 1993, pp. 463-464