scientific article; zbMATH DE number 3588048
From MaRDI portal
Publication:4155835
Cited in
(83)- The optimum assignments and a new heuristic approach for the traveling salesman problem
- Optimal search with positive switch cost is NP-hard
- The algebraic degree of geometric optimization problems
- A fast algorithm for Steiner trees
- Probabilistic analysis of some Euclidean clustering problems
- An optimal solution to a wire-routing problem
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- Worst-case minimum rectilinear Steiner trees in all dimensions
- Fast geometric approximation techniques and geometric embedding problems
- A problem that is easier to solve on the unit-cost algebraic RAM
- The Euclidean traveling salesman problem is NP-complete
- Rearranging data to maximize the efficiency of compression
- Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
- Approximation algorithms for the Geometric Covering Salesman Problem
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Complexity of rational and irrational Nash equilibria
- The traveling salesman problem on grids with forbidden neighborhoods
- Minimum rectilinear Steiner tree of n points in the unit square
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- On the transformation capability of feasible mechanisms for programmable matter
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- Faster algorithms for orienteering and \(k\)-TSP
- The simultaneous semi-random model for TSP
- Hard to solve instances of the Euclidean traveling salesman problem
- Efficient algorithms for sparse cyclotomic integer zero testing
- On Euclidean vehicle routing with allocation
- Good triangulations yield good tours
- Approximation schemes for node-weighted geometric Steiner tree problems
- The structure of minimal Steiner trees in the neighborhoods of the lunes of their edges
- Watchman routes for lines and line segments
- The traveling salesman problem with few inner points
- Vehicle routing on road networks: how good is Euclidean approximation?
- Multi-shuttle crane scheduling in automated storage and retrieval systems
- An estimate of the objective function optimum for the network Steiner problem
- Recursive Markov decision processes and recursive stochastic games
- A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
- Strategies for generating well centered tetrahedral meshes on industrial geometries
- The shortest separating cycle problem
- The Complexity of Nash Equilibria in Limit-Average Games
- On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
- The computational complexity of trembling hand perfection and other equilibrium refinements
- Bounding the sum of square roots via lattice reduction
- Querying probabilistic business processes for sub-flows
- On the computational complexity of centers locating in a graph
- Watchman tours for polygons with holes
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition
- Equilibria, fixed points, and complexity classes
- Constant-factor approximation for TSP with disks
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
- Directional derivative of the weight of a minimal filling in Riemannian manifolds
- Constraint satisfaction problems over numeric domains
- scientific article; zbMATH DE number 7455732 (Why is no real title available?)
- Linear index coding via semidefinite programming
- Algebraic optimization: The Fermat-Weber location problem
- On the Order of Power Series and the Sum of Square Roots Problem
- Financial networks with singleton liability priorities
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Financial networks with singleton liability priorities
- Observation routes and external watchman routes
- Time complexity of the analyst's traveling salesman algorithm
- Euclidean TSP in narrow strips
- Sums of square roots that are close to an integer
- Approximate equality for two sums of roots
- The simultaneous semi-random model for TSP
- Observation routes and external watchman routes
- Identity testing for radical expressions
- Tractability conditions for numeric CSPs
- Noncrossing longest paths and cycles
- Faster approximation scheme for Euclidean k-TSP
- An improved bound on sums of square roots via the subspace theorem
- Pizza sharing is PPA-hard
- A 3/4 differential approximation algorithm for traveling salesman problem
- Geometric TSP on sets
- Geometric TSP on sets
- TSP in a simple polygon
- Vector TSP: a traveling salesperson problem with racetrack-like acceleration constraints
- Lower bounds on the integrality ratio of the subtour LP for the traveling salesman problem
- Designing equilibria in concurrent games with social welfare and temporal logic constraints
- Closed curve covering and multiagent TSP ratios
- Euclidean capacitated vehicle routing in the random setting: a 1.55-approximation algorithm
- Title not available (Why is no real title available?)
- NP-completeness of the Hamming salesman problem
- Cooperative TSP
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4155835)
