The following pages link to P-Complete Approximation Problems (Q4119042):
Displayed 50 items.
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- The complexity of drawing trees nicely (Q1168727) (← links)
- On locating new facilities in a competitive environment (Q1171986) (← links)
- Single and multiple period layout models for automated manufacturing systems (Q1175306) (← links)
- Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833) (← links)
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem (Q1184337) (← links)
- Heuristic task assignment for distributed computing systems (Q1187210) (← links)
- Recent models and techniques for solving the layout problem (Q1197682) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- A nonlinear optimization approach for solving facility layout problems (Q1197687) (← links)
- Simulated annealing for machine layout problems in the presence of zoning constraints (Q1197690) (← links)
- An approximation algorithm for the general routing problem (Q1197996) (← links)
- On the complexity of generating synchronizable test sequences (Q1203646) (← links)
- An interactive layout heuristic based on hexagonal adjacency graphs (Q1205707) (← links)
- Genetic algorithms, function optimization, and facility layout design (Q1205709) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- On the solutions of stochastic traveling salesman problems (Q1247370) (← links)
- A neural network approach to facility layout problems (Q1266731) (← links)
- Optimizing simulated annealing schedules with genetic programming (Q1268274) (← links)
- K-center and K-median problems in graded distances (Q1274996) (← links)
- A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- A stochastic and dynamic routing policy using branching processes with state dependent immigration (Q1278373) (← links)
- Approximation algorithms for min-sum \(p\)-clustering (Q1281390) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- One-dimensional machine location problems in a multi-product flowline with equidistant locations (Q1291754) (← links)
- Flexible machine layout design for dynamic and uncertain production environments (Q1295995) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- Distributed task assignment using critical path estimate (Q1310961) (← links)
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system (Q1318457) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- FACOPT: A user friendly FACility layout OPTimization system. (Q1422356) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Cell formations in the uni-directional loop material handling environment (Q1600849) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- A randomized approximation scheme for metric MAX-CUT (Q1604207) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Solving multi objective facility layout problem by modified simulated annealing (Q1643306) (← links)
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation (Q1651538) (← links)