The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
- Vehicle scheduling in two-cycle flexible manufacturing systems (Q1341395) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- The Convex-hull-and-k-line Travelling Salesman Problem (Q1350909) (← links)
- A polynomial-time approximation scheme for maximizing the minimum machine completion time (Q1362519) (← links)
- Minimizing the total completion time in a unit-time open shop with release times (Q1362528) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
- Hamiltonian cycles in circulant digraphs with two stripes (Q1377694) (← links)
- On-line scheduling of two-machine open shops where jobs arrive over time (Q1383798) (← links)
- On-line and off-line approximation algorithms for vector covering problems (Q1386465) (← links)
- A minimax assignment problem in treelike communication networks (Q1390338) (← links)
- Complexity and approximability results for slicing floorplan designs. (Q1399599) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Which matrices are immune against the transportation paradox? (Q1408459) (← links)
- On the approximability of average completion time scheduling under precedence constraints. (Q1408829) (← links)
- Preemptive scheduling with rejection (Q1411622) (← links)
- A note on the complexity of determining optimal strategies in games with common payoffs (Q1416783) (← links)
- A note on scoring rules that respect majority in choice and elimination. (Q1421928) (← links)
- The Post correspondence problem over a unary alphabet (Q1431872) (← links)
- On the nearest neighbor rule for the traveling salesman problem (Q1433650) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. (Q1575073) (← links)
- The toughness of split graphs (Q1584388) (← links)
- Monge strikes again: Optimal placement of web proxies in the internet (Q1593707) (← links)
- Some comments on sequencing with controllable processing times (Q1599819) (← links)
- Caching for web searching (Q1601026) (← links)
- The reconstruction of polyominoes from their orthogonal projections (Q1603404) (← links)
- A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523) (← links)
- Hardness of approximation of the discrete time-cost tradeoff problem (Q1604050) (← links)
- A very difficult scheduling problem with communication delays (Q1604057) (← links)
- The complexity of multiple wordlength assignment (Q1609441) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- The triangle scheduling problem (Q1617282) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- The dynamics of power laws: fitness and aging in preferential attachment trees (Q1676554) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- The complexity of dominating set in geometric intersection graphs (Q1737591) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Some easy and some not so easy geometric optimization problems (Q1757753) (← links)
- Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- Approximation of the supply scheduling problem (Q1779701) (← links)
- Faster algorithms for computing power indices in weighted voting games (Q1779724) (← links)
- Vote trading and subset sums (Q1785332) (← links)
- Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces (Q1791018) (← links)
