P-Complete Approximation Problems

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Integer programming (90C10)

Cited in

(only showing first 100 items - show all)

A practical method for design of hybrid-type production facilities
Approximating asymmetric TSP in exponential time
Canonical dual approach to solving the maximum cut problem
An interactive layout heuristic based on hexagonal adjacency graphs
Clustering to minimize the maximum intercluster distance
The A priori traveling repairman problem
Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
Approximation algorithms for the bus evacuation problem
The NPO-completeness of the longest Hamiltonian cycle problem
A branch-price-and-cut algorithm for packing cuts in undirected graphs
Design of electronic assembly lines: An analytical framework and its application
Flow network design for manufacturing systems layout
Structure preserving reductions among convex optimization problems
Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Localization in 1D non-parametric latent space models from pairwise affinities
Approximating shortest superstring problem using de Bruijn graphs
Approximation and complexity of multi-target graph search and the Canadian traveler problem
On locating new facilities in a competitive environment
A problem evolution algorithm with linear programming for the dynamic facility layout problem -- a general layout formulation
Optimization of the quadratic assignment problem using an ant colony algorithm
A survey for the quadratic assignment problem
A neural network approach to facility layout problems
Metric violation distance: hardness and approximation
scientific article; zbMATH DE number 3644468 (Why is no real title available?)
Biological computation of the solution to the quadratic assignment problem
Garden optimization problems for benchmarking quantum annealers
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
Approximation algorithms for min-sum \(p\)-clustering
A new formulation for the traveling deliveryman problem
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
One-dimensional machine location problems in a multi-product flowline with equidistant locations
A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
Approximability of the problem about a minimum-weight cycle cover of a graph
Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
An implementation of the iterated tabu search algorithm for the quadratic assignment problem
How to park freight trains on rail-rail transshipment yards: the train location problem
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
On an approximation measure founded on the links between optimization and polynomial approximation theory
Selfish splittable flows and NP-completeness
An improved tabu search heuristic for solving facility layout design problems
On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
An optimization approach for hybrid workflows in platform-enabled private service marketplaces
A New Neighborhood for the QAP
An efficient algorithm for unequal area facilities layout planning with input and output points
The zone-based dynamic facility layout problem
The multi-story space assignment problem
Approximating the maximum quadratic assignment problem
Complexity of the directed spanning cactus problem
A proximal DC approach for quadratic assignment problem
A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
Exact and heuristic solutions to minimize total waiting time in the blood products distribution problem
An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
Domination analysis of some heuristics for the traveling salesman problem
General network design: a unified view of combined location and network design problems
Guaranteed performance heuristics for the bottleneck traveling salesman problem
The Directed Minimum Latency Problem
Gilmore-Lawler bound of quadratic assignment problem
On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight
A biased random-key genetic algorithm for the unequal area facility layout problem
Genetic algorithm for linear and cyclic assignment problem
Discrete extremal problems
Approximation algorithms for some vehicle routing problems
Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system
Polynomial approximation algorithms with performance guarantees: an introduction-by-example
A Survey of the Generalized Assignment Problem and Its Applications
The delivery man problem on a tree network
The on-line asymmetric traveling salesman problem
A branch-and-price algorithm for the minimum latency problem
Distributed task assignment using critical path estimate
Tabu search and iterated local search for the cyclic bottleneck assignment problem
Random assignment problems
A modification of threshold accepting and its application to the quadratic assignment problem
An algorithm for the generalized quadratic assignment problem
A survey on the structure of approximation classes
Cardinality of relations and relational approximation algorithms
Minimum-weight cycle covers and their approximability
Lower bounds for the quadratic assignment problem via triangle decompositions
A new linearization method for quadratic assignment problems
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing
Bounds for the quadratic assignment problem using the bundle method
A LP-based approximation algorithm for generalized traveling salesperson path problem
Matrix columns allocation problems
The latency location-routing problem
Algorithm for the discrete Weber's problem with an accuracy estimate
Improved approximations for hard optimization problems via problem instance classification
Massively parallel tabu search for the quadratic assignment problem
Computational methods for solving nonconvex block-separable constrained quadratic problems
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem
Constant-factor approximations for capacitated arc routing without triangle inequality
On the integrality ratio of the subtour LP for Euclidean TSP
Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
Better Process Mapping and Sparse Quadratic Assignment
An improved approximation ratio for the minimum latency problem
Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
Extending time-to-target plots to multiple instances
An extreme point algorithm for a local minimum solution to the quadratic assignment problem
Finite element approximation of data-driven problems in conductivity

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)