The following pages link to (Q4155835):
Displaying 50 items.
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
- Querying probabilistic business processes for sub-flows (Q359875) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Directional derivative of the weight of a minimal filling in Riemannian manifolds (Q493881) (← links)
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- NP-completeness of the Hamming salesman problem (Q761246) (← links)
- Cooperative TSP (Q982655) (← links)
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- Optimal search with positive switch cost is NP-hard (Q1065706) (← links)
- The algebraic degree of geometric optimization problems (Q1104865) (← links)
- A fast algorithm for Steiner trees (Q1145507) (← links)
- Probabilistic analysis of some Euclidean clustering problems (Q1147633) (← links)
- An optimal solution to a wire-routing problem (Q1156772) (← links)
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem (Q1158107) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- A problem that is easier to solve on the unit-cost algebraic RAM (Q1203641) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Rearranging data to maximize the efficiency of compression (Q1263976) (← links)
- Minimal binary trees with a regular boundary: The case of skeletons with five endpoints (Q1274069) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- Approximating maxmin strategies in imperfect recall games using A-loss recall property (Q1726399) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation (Q1823875) (← links)
- Faster algorithms for orienteering and \(k\)-TSP (Q2124233) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges (Q2435948) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- Vehicle routing on road networks: how good is Euclidean approximation? (Q2668618) (← links)
- Multi-shuttle crane scheduling in automated storage and retrieval systems (Q2672114) (← links)
- Recursive Markov decision processes and recursive stochastic games (Q2796398) (← links)
- A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
- Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries (Q2948920) (← links)
- The Shortest Separating Cycle Problem (Q2971152) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
