The following pages link to Gerhard J. Woeginger (Q170010):
Displaying 50 items.
- A note on the complexity of the transportation problem with a permutable demand vector (Q1806274) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- The two-machine open shop problem: To fit or not to fit, that is the question (Q1811630) (← links)
- The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs (Q1849260) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981) (← links)
- Recognizing DNA graphs is difficult. (Q1868714) (← links)
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Seventeen lines and one-hundred-and-one points (Q1885913) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- New lower and upper bounds for on-line scheduling (Q1892104) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Scheduling with safety distances (Q1897388) (← links)
- On the complexity of function learning (Q1900975) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- The fractional greedy algorithm for data compression (Q1906680) (← links)
- Three-dimensional axial assignment problems with decomposable cost coefficients (Q1917264) (← links)
- An optimal algorithm for preemptive on-line scheduling (Q1919176) (← links)
- UET-scheduling with chain-type precedence constraints (Q1919973) (← links)
- On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes (Q1922678) (← links)
- On the recognition of permuted Supnick and incomplete Monge matrices (Q1924991) (← links)
- A new characterization of the majority rule (Q1927374) (← links)
- More on the majority rule: profiles, societies, and responsiveness (Q1927853) (← links)
- Fully decomposable split graphs (Q1933640) (← links)
- Between a rock and a hard place: the two-to-one assignment problem (Q1935948) (← links)
- A hardness result for core stability in additive hedonic games (Q1940711) (← links)
- The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061) (← links)
- A comment on scheduling on uniform machines under chain-type precedence constraints (Q1977643) (← links)
- A linear time algorithm for the robust recoverable selection problem (Q1983118) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- Dispersing obnoxious facilities on a graph (Q2032349) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- Computation and complexity (Q2075759) (← links)
- A note on the complexity of the bilevel bottleneck assignment problem (Q2095526) (← links)
- Continuous facility location on graphs (Q2118124) (← links)
- The \(x\)-and-\(y\)-axes travelling salesman problem (Q2253351) (← links)
- Parallel machine scheduling with nested job assignment restrictions (Q2270323) (← links)
- A well-solvable special case of the bounded knapsack problem (Q2275577) (← links)
- The Northwest corner rule revisited (Q2275935) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- Approximability and parameterized complexity of multicover by \(c\)-intervals (Q2348702) (← links)
- Well-solvable instances for the partition problem (Q2371107) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- The one-dimensional Euclidean domain: finitely many obstructions are not enough (Q2397665) (← links)
