AAAAAA

   
Results: 1-25 | 26-44
Results: 1-25/44
ONLINE SCHEDULING OF 2-MACHINE OPEN SHOPS WHERE JOBS ARRIVE OVER TIME
Authors: CHEN B VESTJENS APA WOEGINGER GJ
Citation: B. Chen et al., ONLINE SCHEDULING OF 2-MACHINE OPEN SHOPS WHERE JOBS ARRIVE OVER TIME, Journal of combinatorial optimization, 1(4), 1998, pp. 355-365
THE COMPUTATIONAL-COMPLEXITY OF THE K-MINIMUM SPANNING TREE PROBLEM IN GRADED MATRICES
Authors: DUDAS T KLINZ B WOEGINGER GJ
Citation: T. Dudas et al., THE COMPUTATIONAL-COMPLEXITY OF THE K-MINIMUM SPANNING TREE PROBLEM IN GRADED MATRICES, Computers & mathematics with applications (1987), 36(5), 1998, pp. 61-67
SOMETIMES TRAVELING IS EASY - THE MASTER TOUR PROBLEM
Authors: DEINEKO VG RUDOLF R WOEGINGER GJ
Citation: Vg. Deineko et al., SOMETIMES TRAVELING IS EASY - THE MASTER TOUR PROBLEM, SIAM journal on discrete mathematics, 11(1), 1998, pp. 81-93
ONLINE AND OFF-LINE APPROXIMATION ALGORITHMS FOR VECTOR COVERING PROBLEMS
Authors: ALON N AZAR Y CSIRIK J EPSTEIN L SEVASTIANOV SV VESTJENS APA WOEGINGER GJ
Citation: N. Alon et al., ONLINE AND OFF-LINE APPROXIMATION ALGORITHMS FOR VECTOR COVERING PROBLEMS, Algorithmica, 21(1), 1998, pp. 104-118
ONE, 2, 3, MANY, OR - COMPLEXITY ASPECTS OF DYNAMIC NETWORK FLOWS WITH DEDICATED ARCS
Authors: KLINZ B WOEGINGER GJ
Citation: B. Klinz et Gj. Woeginger, ONE, 2, 3, MANY, OR - COMPLEXITY ASPECTS OF DYNAMIC NETWORK FLOWS WITH DEDICATED ARCS, Operations research letters, 22(4-5), 1998, pp. 119-127
A SOLVABLE CASE OF THE QUADRATIC ASSIGNMENT PROBLEM
Authors: DEINEKO VG WOEGINGER GJ
Citation: Vg. Deineko et Gj. Woeginger, A SOLVABLE CASE OF THE QUADRATIC ASSIGNMENT PROBLEM, Operations research letters, 22(1), 1998, pp. 13-17
WELL-SOLVABLE SPECIAL CASES OF THE TRAVELING SALESMAN PROBLEM - A SURVEY
Authors: BURKARD RE DEINEKO VG VANDAL R VANDERVEEN JAA WOEGINGER GJ
Citation: Re. Burkard et al., WELL-SOLVABLE SPECIAL CASES OF THE TRAVELING SALESMAN PROBLEM - A SURVEY, SIAM review (Print), 40(3), 1998, pp. 496-546
THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES
Authors: BURKARD RE CELA E ROTE G WOEGINGER GJ
Citation: Re. Burkard et al., THE QUADRATIC ASSIGNMENT PROBLEM WITH A MONOTONE ANTI-MONGE AND A SYMMETRICAL TOEPLITZ MATRIX - EASY AND HARD CASES, Mathematical programming, 82(1-2), 1998, pp. 125-158
MAKESPAN MINIMIZATION IN OPEN SHOPS - A POLYNOMIAL-TIME APPROXIMATIONSCHEME
Authors: SEVASTIANOV SV WOEGINGER GJ
Citation: Sv. Sevastianov et Gj. Woeginger, MAKESPAN MINIMIZATION IN OPEN SHOPS - A POLYNOMIAL-TIME APPROXIMATIONSCHEME, Mathematical programming, 82(1-2), 1998, pp. 191-198
SEQUENCING JOBS THAT REQUIRE COMMON RESOURCES ON A SINGLE-MACHINE - ASOLVABLE CASE OF THE TSP
Authors: VANDERVEEN JAA WOEGINGER GJ ZHANG SZ
Citation: Jaa. Vanderveen et al., SEQUENCING JOBS THAT REQUIRE COMMON RESOURCES ON A SINGLE-MACHINE - ASOLVABLE CASE OF THE TSP, Mathematical programming, 82(1-2), 1998, pp. 235-254
MAKESPAN MINIMIZATION IN PREEMPTIVE 2 MACHINE JOB SHOPS
Authors: SEVASTIANOV SV WOEGINGER GJ
Citation: Sv. Sevastianov et Gj. Woeginger, MAKESPAN MINIMIZATION IN PREEMPTIVE 2 MACHINE JOB SHOPS, Computing, 60(1), 1998, pp. 73-79
SIMPLE BUT EFFICIENT APPROACHES FOR THE COLLAPSING KNAPSACK-PROBLEM
Authors: PFERSCHY U PISINGER D WOEGINGER GJ
Citation: U. Pferschy et al., SIMPLE BUT EFFICIENT APPROACHES FOR THE COLLAPSING KNAPSACK-PROBLEM, Discrete applied mathematics, 77(3), 1997, pp. 271-280
THE COMPUTATIONAL-COMPLEXITY OF STEINER TREE PROBLEMS IN GRADED MATRICES
Authors: DUDAS T KLINZ B WOEGINGER GJ
Citation: T. Dudas et al., THE COMPUTATIONAL-COMPLEXITY OF STEINER TREE PROBLEMS IN GRADED MATRICES, Applied mathematics letters, 10(4), 1997, pp. 35-39
3 EASY SPECIAL CASES OF THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
Authors: DEINEKO VG VANDERVEEN JA RUDOLF R WOEGINGER GJ
Citation: Vg. Deineko et al., 3 EASY SPECIAL CASES OF THE EUCLIDEAN TRAVELING SALESMAN PROBLEM, RAIRO. Recherche operationnelle, 31(4), 1997, pp. 343-362
GREEDY ALGORITHMS FOR ONLINE DATA-COMPRESSION
Authors: BEKESI J GALAMBOS G PFERSCHY U WOEGINGER GJ
Citation: J. Bekesi et al., GREEDY ALGORITHMS FOR ONLINE DATA-COMPRESSION, Journal of algorithms, 25(2), 1997, pp. 274-289
MINIMIZING THE TOTAL COMPLETION-TIME IN A UNIT-TIME OPEN SHOP WITH RELEASE TIMES
Authors: TAUTENHAHN T WOEGINGER GJ
Citation: T. Tautenhahn et Gj. Woeginger, MINIMIZING THE TOTAL COMPLETION-TIME IN A UNIT-TIME OPEN SHOP WITH RELEASE TIMES, Operations research letters, 20(5), 1997, pp. 207-212
A POLYNOMIAL-TIME APPROXIMATION SCHEME FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION-TIME
Authors: WOEGINGER GJ
Citation: Gj. Woeginger, A POLYNOMIAL-TIME APPROXIMATION SCHEME FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION-TIME, Operations research letters, 20(4), 1997, pp. 149-154
A NOTE ON AN ONLINE SCHEDULING HEURISTIC WITH BETTER WORST-CASE RATIOTHAN GRAHAMS LIST SCHEDULING
Authors: CHANDRASEKARAN R CHEN B GALAMBOS G NARAYANAN PR VANVLIET A WOEGINGER GJ
Citation: R. Chandrasekaran et al., A NOTE ON AN ONLINE SCHEDULING HEURISTIC WITH BETTER WORST-CASE RATIOTHAN GRAHAMS LIST SCHEDULING, SIAM journal on computing, 26(3), 1997, pp. 870-872
THERE IS NO ASYMPTOTIC PTAS FOR 2-DIMENSIONAL VECTOR PACKING
Authors: WOEGINGER GJ
Citation: Gj. Woeginger, THERE IS NO ASYMPTOTIC PTAS FOR 2-DIMENSIONAL VECTOR PACKING, Information processing letters, 64(6), 1997, pp. 293-297
ALGORITHMS FOR ONLINE STRIP PACKING
Authors: CSIRIK J WOEGINGER GJ
Citation: J. Csirik et Gj. Woeginger, ALGORITHMS FOR ONLINE STRIP PACKING, Information processing letters, 63(4), 1997, pp. 171-175
UNIT-TIME SCHEDULING PROBLEMS WITH TIME-DEPENDENT RESOURCES
Authors: TAUTENHAHN T WOEGINGER GJ
Citation: T. Tautenhahn et Gj. Woeginger, UNIT-TIME SCHEDULING PROBLEMS WITH TIME-DEPENDENT RESOURCES, Computing, 58(2), 1997, pp. 97-111
3-DIMENSIONAL AXIAL ASSIGNMENT PROBLEMS WITH DECOMPOSABLE COST COEFFICIENTS
Authors: BURKARD RE RUDOLF R WOEGINGER GJ
Citation: Re. Burkard et al., 3-DIMENSIONAL AXIAL ASSIGNMENT PROBLEMS WITH DECOMPOSABLE COST COEFFICIENTS, Discrete applied mathematics, 65(1-3), 1996, pp. 123-139
GEOMETRIC 3-DIMENSIONAL ASSIGNMENT PROBLEMS
Authors: SPIEKSMA FCR WOEGINGER GJ
Citation: Fcr. Spieksma et Gj. Woeginger, GEOMETRIC 3-DIMENSIONAL ASSIGNMENT PROBLEMS, European journal of operational research, 91(3), 1996, pp. 611-618
THE CONVEX-HULL-AND-K-LINE TRAVELING SALESMAN PROBLEM
Authors: DEINEKO VG WOEGINGER GJ
Citation: Vg. Deineko et Gj. Woeginger, THE CONVEX-HULL-AND-K-LINE TRAVELING SALESMAN PROBLEM, Information processing letters, 59(6), 1996, pp. 295-301
THE FRACTIONAL GREEDY ALGORITHM FOR DATA-COMPRESSION
Authors: BEKESI J GALAMBOS G PFERSCHY U WOEGINGER GJ
Citation: J. Bekesi et al., THE FRACTIONAL GREEDY ALGORITHM FOR DATA-COMPRESSION, Computing, 56(1), 1996, pp. 29-46
Risultati: 1-25 | 26-44