General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Deterministic network models in operations research (90B10) Integer programming (90C10) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)
Cited in
(only showing first 100 items - show all)- An algorithm for the generalized quadratic assignment problem
- A new formulation for the traveling deliveryman problem
- Matrix columns allocation problems
- Minimum-weight cycle covers and their approximability
- Reoptimization of minimum and maximum traveling salesman's tours
- The optimum assignments and a new heuristic approach for the traveling salesman problem
- Clustering to minimize the maximum intercluster distance
- Probabilistic asymptotic properties of some combinatorial optimization problems
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- An asymptotically exact polynomial algorithm for equipartition problems
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Implications of forbidden structures for extremal algorithmic problems
- The principle of optimality in the design of efficient algorithms
- The facility layout problem
- Layouts with wires of balanced length
- Design of electronic assembly lines: An analytical framework and its application
- Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
- An algorithm for quadratic assignment problems
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem
- Easy and hard bottleneck location problems
- Structure preserving reductions among convex optimization problems
- Non deterministic polynomial optimization problems and their approximations
- Optimization problems and the polynomial hierarchy
- Discrete extremal problems
- An effective structured approach to finding optimal partitions of networks
- The complexity of drawing trees nicely
- On locating new facilities in a competitive environment
- Single and multiple period layout models for automated manufacturing systems
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Heuristic task assignment for distributed computing systems
- Recent models and techniques for solving the layout problem
- Flow network design for manufacturing systems layout
- A nonlinear optimization approach for solving facility layout problems
- Simulated annealing for machine layout problems in the presence of zoning constraints
- An approximation algorithm for the general routing problem
- On the complexity of generating synchronizable test sequences
- An interactive layout heuristic based on hexagonal adjacency graphs
- Genetic algorithms, function optimization, and facility layout design
- Four solution techniques for a general one machine scheduling problem. A comparative study
- On the solutions of stochastic traveling salesman problems
- A neural network approach to facility layout problems
- Optimizing simulated annealing schedules with genetic programming
- K-center and K-median problems in graded distances
- A polynomially solvable class of quadratic semi-assignment problems
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem
- A stochastic and dynamic routing policy using branching processes with state dependent immigration
- Approximation algorithms for min-sum \(p\)-clustering
- An improved approximation ratio for the minimum latency problem
- One-dimensional machine location problems in a multi-product flowline with equidistant locations
- Flexible machine layout design for dynamic and uncertain production environments
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- Clustering heuristics for set covering
- Distributed task assignment using critical path estimate
- A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- The hardness of approximation: Gap location
- Lower bounds for the quadratic assignment problem
- A study of diversification strategies for the quadratic assignment problem
- A new exact algorithm for the solution of quadratic assignment problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Lower bounds for the quadratic semi-assignment problem
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- FACOPT: A user friendly FACility layout OPTimization system.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Cell formations in the uni-directional loop material handling environment
- Domination analysis of some heuristics for the traveling salesman problem
- A randomized approximation scheme for metric MAX-CUT
- Approximating the maximum quadratic assignment problem
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
- On residual approximation in solution extension problems
- Approximation and complexity of multi-target graph search and the Canadian traveler problem
- Solving multi objective facility layout problem by modified simulated annealing
- A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
- A branch-and-price algorithm for the minimum latency problem
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
- A -accurate linearization method of Euclidean distance for the facility layout problem with heterogeneous distance metrics
- Locating names on vertices of a transaction network
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Compact linearization for binary quadratic problems subject to assignment constraints
- An exact algorithm for the minimum squared load assignment problem
- Minimizing latency in post-disaster road clearance operations
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- Random Laplacian matrices and convex relaxations
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing
- Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems
- New linearizations of quadratic assignment problems
- A discrete dynamic convexized method for the max-cut problem
- Approximation algorithms for some vehicle routing problems
- Complexity of the directed spanning cactus problem
- Some global optimization problems on Stiefel manifolds
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Constant-factor approximations for capacitated arc routing without triangle inequality
- On the integrality ratio of the subtour LP for Euclidean TSP
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
This page was built for publication: P-Complete Approximation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4119042)
