The following pages link to P-Complete Approximation Problems (Q4119042):
Displaying 50 items.
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- Minimizing latency in post-disaster road clearance operations (Q1740563) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing (Q1761211) (← links)
- Topological arrangements of \(M/G/c/K\), \(M/G/c/c\) queues in transportation and material handling systems (Q1761231) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- Complexity of the directed spanning cactus problem (Q1765377) (← links)
- Some global optimization problems on Stiefel manifolds (Q1768631) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- A performance guarantee heuristic for electronic components placement problems including thermal effects (Q1781568) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure (Q1785334) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- On local search for the generalized graph coloring problem (Q1870000) (← links)
- An extreme point algorithm for a local minimum solution to the quadratic assignment problem (Q1877896) (← links)
- A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- Multi-level departments-to-offices assignment with different room types (Q2002846) (← links)
- Minimizing the average searching time for an object within a graph (Q2007833) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- Approximation algorithms for general cluster routing problem (Q2019492) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- Metric violation distance: hardness and approximation (Q2134750) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models (Q2173001) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Determining matchdays in sports league schedules to minimize rest differences (Q2183190) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← links)
- Solving the quadratic assignment problem (Q2215269) (← links)
- Embedding signed graphs in the line (Q2253962) (← links)
- A parallel heuristic for quadratic assignment problems (Q2276872) (← links)
