Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries
From MaRDI portal
Publication:2948920
DOI10.1007/978-3-319-06053-8_8zbMath1327.65258OpenAlexW858305040MaRDI QIDQ2948920
Sean Walton, Kenneth Morgan, Oubay Hassan
Publication date: 6 October 2015
Published in: New Challenges in Grid Generation and Adaptivity for Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06053-8_8
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- Mathematical models in marketing. A collection of abstracts. With a preface by M. Beckmann
- The Euclidean traveling salesman problem is NP-complete
- Order picking in an automatic warehouse: Solving online asymmetric TSPs
- A heuristic approach to the overnight security service problem
- Worst-case analysis of a new heuristic for the travelling salesman problem
- City-courier routing and scheduling problems
- Integer linear programming formulations of multiple salesman problems and its variations
- Integer Programming Formulation of Traveling Salesman Problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A Cutting Planes Algorithm for the m-Salesmen Problem
- Technical Note—A Note on the Multiple Traveling Salesmen Problem
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Travelling Salesman and Assignment Problems: A Survey
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- Reducibility among Combinatorial Problems
- On the History of Combinatorial Optimization (Till 1960)
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling Salesman Problem: A Survey
- Combinatorial optimization. Theory and algorithms
