The following pages link to P-Complete Approximation Problems (Q4119042):
Displaying 50 items.
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- A new algorithm for solving a special matching problem with a general form value function under constraints (Q2287164) (← links)
- Modeling and solving a bi-objective airport slot scheduling problem (Q2301948) (← links)
- A priority based unbalanced time minimization assignment problem (Q2307977) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- A multi-parent genetic algorithm for the quadratic assignment problem (Q2359229) (← links)
- A complexity theory for feasible closure properties (Q2366687) (← links)
- Massively parallel tabu search for the quadratic assignment problem (Q2367011) (← links)
- Genetic algorithm for linear and cyclic assignment problem (Q2367417) (← links)
- Ant colony optimization for solving an industrial layout problem (Q2371353) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- Integrating combinatorial algorithms into a linear programming solver (Q2418164) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- A parallel water flow algorithm with local search for solving the quadratic assignment problem (Q2423282) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- Communication-aware processor allocation for supercomputers: Finding point sets of small average distance (Q2480901) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Completeness in approximation classes beyond APX (Q2503307) (← links)
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem (Q2506218) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- A tabu search heuristic for the dynamic space allocation problem (Q2566942) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- On the complexity of some quadratic Euclidean 2-clustering problems (Q2630045) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem (Q2661489) (← links)
- Multi- and many-objective path-relinking: a taxonomy and decomposition approach (Q2668797) (← links)
- Routing multiple work teams to minimize latency in post-disaster road network restoration (Q2670582) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Garden optimization problems for benchmarking quantum annealers (Q2685606) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- The three-phase method: a unified approach to orthogonal graph drawing (Q2708038) (← links)
- Computational methods for solving nonconvex block-separable constrained quadratic problems (Q2810546) (← links)
- A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- A simulated annealing for intra-cell layout design of dynamic cellular manufacturing systems with route selection, purchasing machines and cell reconfiguration (Q2853403) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Approximation performance of ant colony optimization for the TSP(1,2) problem (Q2957749) (← links)
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem (Q2958360) (← links)
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem (Q2959183) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- A layout design heuristic employing the theory of fuzzy sets (Q3028685) (← links)
- (Q3049800) (← links)
- An integrated approach to determine the block layout, AGV flow path and the location of pick-up/delivery points in single-loop systems (Q3055455) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
