Search references for QUADRATIC ASSIGNMENT-PROBLEM. Phrases containing QUADRATIC ASSIGNMENT-PROBLEM
See searches and references containing QUADRATIC ASSIGNMENT-PROBLEM!QUADRATIC ASSIGNMENT-PROBLEM
Combinatorial optimization problem
The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research
Quadratic_assignment_problem
Combinatorial optimization problem
The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has
Assignment_problem
In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of the fundamental combinatorial optimization problems in the branch of optimization
Quadratic bottleneck assignment problem
Quadratic_bottleneck_assignment_problem
scheduling Partition problem Quadratic assignment problem Quadratic programming (NP-hard in some cases, P if convex) Subset sum problem Variations on the
List_of_NP-complete_problems
Architectural planning problem of assigning rooms and spaces within a building
in industrial engineering, which is commonly formulated as a quadratic assignment problem. Facility-layout research often concentrates on the placement
Space_allocation_problem
Combinatorial optimization problem
Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem
Quadratic unconstrained binary optimization
Quadratic_unconstrained_binary_optimization
Topics referred to by the same term
Colombian newscast that aired between 1992 and 1997 Quadratic assignment problem Quadratic assignment procedure, a method for evaluating the significance
QAP
algorithm Closure problem Generalized assignment problem Linear bottleneck assignment problem Quadratic assignment problem Stable marriage problem Andersen, A
Weapon-target assignment problem
Weapon-target_assignment_problem
Optimization algorithm
routing problem with time windows (TDVRPTW) Vehicle routing problem with time windows and multiple service workers (VRPTWMS) Quadratic assignment problem (QAP)
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Optimization by removing non-optimal solutions to subproblems
number of NP-hard problems: Integer programming Nonlinear programming Travelling salesman problem (TSP) Quadratic assignment problem (QAP) Maximum satisfiability
Branch_and_bound
Combinatorial optimization method for pseudo-Boolean functions
computer vision problems such as image segmentation and stereo matching. If the coefficients w p q {\displaystyle w_{pq}} of the quadratic terms satisfy
Quadratic pseudo-Boolean optimization
Quadratic_pseudo-Boolean_optimization
Discipline concerning the application of advanced analytical methods
allocation problems Facility location Assignment Problems: Assignment problem Generalized assignment problem Quadratic assignment problem Weapon target
Operations_research
Optimizing objective functions that have constrained variables
problem is a nonlinear programming problem. If all the hard constraints are linear and some are inequalities, but the objective function is quadratic
Constrained_optimization
capacity, we can have multiple subset sum problem. Quadratic knapsack problem: Set-Union Knapsack Problem: SUKP is defined by Kellerer et al (on page
List_of_knapsack_problems
OV in complexity theory
satisfiability problem as sets of vectors. At a high level, a Boolean formula can be written as two sets of binary vectors such that a satisfying assignment exists
Orthogonal_vectors_problem
Optimization problem
Weber problem), or one might elect to minimize the maximum of all such distances (à la the 1-center problem). Graph center Quadratic assignment problem Location-allocation
Optimal_facility_location
range of parameter settings, particularly in the case of the quadratic assignment problem. A general version of the GLS algorithm, using a min-conflicts
Guided_local_search
Study of optimal transportation and allocation of resources
This motivating special case of the transportation problem is an instance of the assignment problem. More specifically, it is equivalent to finding a minimum
Transportation theory (mathematics)
Transportation_theory_(mathematics)
multidimensional knapsack problem 0-1 knapsack problem maximum cut problem quadratic assignment problem facility layout problem wind farm layout Hyper-heuristics
Hyper-heuristic
Mathematical relation assigning a probability event to a cost
based on the quadratic loss function. The quadratic loss function is also used in linear-quadratic optimal control problems. In these problems, even in the
Loss_function
Algorithm for searching a problem space
classical NP problems. To cite some of them: graph partitioning, multidimensional knapsack, travelling salesman problem, quadratic assignment problem, set cover
Memetic_algorithm
British mathematician (1927–2021)
resulting in contributions to data envelopment analysis, the quadratic assignment problem, and combinatorial auctions. In addition to her methodological
Ailsa_Land
Generalization of binary functions
than 2, one can always employ reductions to obtain an equivalent quadratic problem with additional variables. One possible reduction is −x1x2x3=minz∈𝐁z(2−x1−x2−x3)
Pseudo-Boolean_function
solvability of the quadratic assignment problem (QAP), heuristic solvability and sensitivity analysis for the Hub Location Problem (HLP), and optimization
Jadranka_Skorin-Kapov
On solvability of Diophantine equations
Shnidman, Ari (December 2025). "Rank stability in quadratic extensions and Hilbert's tenth problem for the ring of integers of a number field". Inventiones
Hilbert's_tenth_problem
Optimization solver
(LP), quadratic programming (QP), quadratically constrained programming (QCP), mixed integer linear programming (MILP), mixed-integer quadratic programming
Gurobi_Optimizer
1016/j.dam.2003.08.005, MR 2049654. Çela, Eranda (1998), The Quadratic Assignment Problem: Theory and Algorithms, Combinatorial Optimization, vol. 1, Dordrecht:
Kalmanson combinatorial conditions
Kalmanson_combinatorial_conditions
Optimization algorithm
(1984). "A modified Frank-Wolfe algorithm for solving the traffic assignment problem". Transportation Research Part B: Methodological. 18 (2): 169–177
Frank–Wolfe_algorithm
American mathematician (1914–2005)
both problems, still believing that they were an assignment that was overdue. Six weeks later, an excited Neyman happily told him that the problems he had
George_Dantzig
Chronological table of metaheuristic algorithms
Optimization: A new metaheuristic approach and its performance on quadratic assignment problem". Information Sciences. 217: 65–77. doi:10.1016/j.ins.2012.06
Table_of_metaheuristics
Engineer
problems." Management Science 40.11 (1994): 1542-1561. Malakooti, B., and G. I. D'souza. "Multiple objective programming for the quadratic assignment
Behnam_Malakooti
Method to solve optimization problems
Abstraction of ordered linear algebra Quadratic programming – Solving an optimization problem with a quadratic objective function Semidefinite programming –
Linear_programming
Monte Carlo method for importance sampling and optimization
salesman, quadratic assignment, DNA sequence alignment, max-cut and buffer allocation problems.[citation needed] Consider the general problem of estimating
Cross-entropy_method
Task of computing complete subgraphs
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete
Clique_problem
Problem in formal logic
The problem is also in P by the same transformation: any satisfying assignment to this Horn formula is the negation of a satisfying assignment to the
Horn-satisfiability
Procedure for finding a stable matching
to run in time quadratic in the number of participants, and linear in the size of the input to the algorithm. The stable matching problem, and the Gale–Shapley
Gale–Shapley_algorithm
Subfield of mathematical optimization
the class of NPO problems that are polynomially-bounded. Assignment problem Bin packing problem Chinese postman problem Closure problem Constraint satisfaction
Combinatorial_optimization
Type of numerical analysis
directed acyclic graph (dag) with vertices 1,2,…n). Problems of this form may be solved by generic quadratic programming techniques. In the usual setting where
Isotonic_regression
Logic problem, AND of pairwise ORs
2-satisfiability problem is to find a truth assignment to the variables of a formula in this form that makes the whole formula true. Such an assignment chooses
2-satisfiability
Fractal named after mathematician Benoit Mandelbrot
Mandelbrot first visualized the set. Mandelbrot studied the parameter space of quadratic polynomials in an article that appeared in 1980. The mathematical study
Mandelbrot_set
Pakistani computer scientist
linear systems as band matrices with low bandwidth, and to the quadratic assignment problem. This is the work for which Bokhari was cited in his IEEE Fellow
Shahid_Hussain_Bokhari
Computer compiler optimization technique
Chaitin-Briggs style register allocation. In response to this problem, Partitioned Boolean Quadratic Programming (PBQP) was developed. PBQP attempts to unify
Register_allocation
disjoint sets Antichain Arrangement of hyperplanes Assignment problem Quadratic assignment problem Audioactive decay Barcode Matrix code QR Code Universal
Index of combinatorics articles
Index_of_combinatorics_articles
Measure of variation in statistics
yielding: σ̂=1N−1.5∑i=1N(xi−x¯)2, The error in this approximation decays quadratically (as 1/N2), and it is suited for all but the smallest samples or highest
Standard_deviation
Finding values for variables that make an equation true
case when considering polynomial equations, such as quadratic equations. However, for some problems, all variables may assume either role. Depending on
Equation_solving
Combinatorial optimization method for a family of functions of discrete variables
capture the nature of the problem and it can provide higher quality results that could be difficult to achieve with quadratic models. For instance in computer
Graph_cut_optimization
Method for problem solving in optimization
satisfiability, the neighbors of a Boolean assignment are those that have a single variable in an opposite state. The same problem may have multiple distinct neighborhoods
Local_search_(optimization)
Stage of electronic circuit design
placement density as a linear term into the quadratic cost function and solves the placement problem by pure quadratic programming. A common enhancement is weighting
Placement (electronic design automation)
Placement_(electronic_design_automation)
Problem optimization method
possible assignments and (nn/2)n sensible assignments, this strategy is not practical for arbitrarily large values of n. Backtracking for this problem consists
Dynamic_programming
Mathematical combinatorial optimization method
multi-coloring problem can be used to model a variety of applications including job scheduling and telecommunication channel assignment. Vehicle routing problems. Generalized
Branch_and_price
Least squares approximation of linear functions to data
substituting for ri and then for f, this minimization problem becomes the quadratic minimization problem above with Xij=φj(xi), and the best fit can be found
Linear_least_squares
Linear programming algorithm
Approach to a Tensor Optimisation Problem with Application to Upper Bounds in Integer Quadratic Optimization Problems, Proceedings of Second Conference
Karmarkar's_algorithm
Typesetting system
specifically for mathematical formulas. For example, the quadratic formula (which is the solution of the quadratic equation) appears as: The formula is printed in
TeX
When every path in a control-flow graph must go through one node to reach another
they applied it to the problem of efficiently computing the placement of φ functions, which are used in static single assignment form. Dominators, and
Dominator_(graph_theory)
Type of experimental design
and seed matrices, respectively, with Plackett–Burmans. For example, a quadratic design for 30 variables requires a 30 column PB plan matrix of zeroes
Plackett–Burman_design
Graph drawing with vertices in horizontal layers
position with respect to its neighbors. Sugiyama's original work proposed a quadratic programming formulation of this step; a later method of Brandes and Köpf
Layered_graph_drawing
Approach in control theory to achieve fault-tolerant control for dynamic systems
control schemes include: linear-quadratic regulator design (LQR), model predictive control (MPC) and eigenstructure assignment methods. Some probabilistic
Control_reconfiguration
DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of
Distributed constraint optimization
Distributed_constraint_optimization
Primal-Dual algorithm optimization for convex problems
Chambolle–Pock algorithm is an algorithm used to solve convex optimization problems. It was introduced by Antonin Chambolle and Thomas Pock in 2011 and has
Chambolle–Pock_algorithm
Node labeling problem in graph theory
weighted versions are special cases of the quadratic bottleneck assignment problem. The bandwidth problem is NP-hard, even for some special cases. Regarding
Graph_bandwidth
Approximation method in statistics
distribution on the parameter vector. The optimization problem may be solved using quadratic programming or more general convex optimization methods
Least_squares
Evolutionary algorithm
stochastic variable-metric method. In the very particular case of a convex-quadratic objective function f(x)=12(x−x∗)TH(x−x∗) the covariance matrix Ck adapts
CMA-ES
German computer scientist
of a Deterministic Annealing Method for Graph Matching and Quadratic Assignment Problems in Computer Vision". He then studied computer science at Brown
Stefan_Roth
Density-based data clustering algorithm
Commons Math contains a Java implementation of the algorithm running in quadratic time. ELKI offers an implementation of DBSCAN as well as GDBSCAN and other
DBSCAN
constant or balanced Grover's algorithm: provides a quadratic speedup for unstructured search problems Hadamard test: circuit technique for estimating real
List_of_algorithms
Branch of type theory
Coppo–Dezani type assignment system, the Barendregt-Coppo–Dezani type assignment system, and the essential intersection type assignment system. Most strikingly
Intersection_type_discipline
Relation in theoretical computer science
alphabet Σ∪Ξ comprising both constants (cf. Σ) and unknowns (cf. Ξ). An assignment h of constant words to the unknowns of E is said to solve E if it maps
Word_equation
Method for division with remainder
result. It is also possible to use a mixture of quadratic and cubic iterations. Using at least one quadratic iteration ensures that the error is positive
Division_algorithm
Computational complexity
in 1994 (Papadimitriou 1994 Problem 16.4.10, "Symmetric space"). Since larger space classes are not affected by quadratic increases, the nondeterministic
NL_(complexity)
Hungarian mathematician (born 1955)
Terlaky, Tamás (2000) "On copositive programming and standard quadratic optimization problems" Journal of Global Optimization 18 (4), 301-320. Nemirovski
Tamás_Terlaky
Distance function defined between probability distributions
any open subset X⊂ℝn with smooth boundary. Consider the quadratic cost transport problem from the uniform distribution on X to the uniform distribution
Wasserstein_metric
Method used in statistics, pattern recognition, and other fields
Without any further assumptions, the resulting classifier is referred to as quadratic discriminant analysis (QDA). LDA instead makes the additional simplifying
Linear_discriminant_analysis
Method of making choices that maximises utility
auctions, calculating the optimal assignment is NP-hard. Sometimes there are approximation algorithms to the optimization problem, but, using such an approximation
Vickrey–Clarke–Groves mechanism
Vickrey–Clarke–Groves_mechanism
Optimization using parameterization
function in (multi)parametric (mixed-integer) linear, quadratic and nonlinear programming problems is performed. Note that this generally assumes the constraints
Parametric_programming
Categorization of data using statistics
and clustering are examples of the more general problem of pattern recognition, which is the assignment of some sort of output value to a given input value
Statistical_classification
Belarusian mathematician (1931–2024)
programming problems, and she created numerical methods for the solution of linear, quadratic, nonlinear programming, and optimal control problems. She developed
Faina_Kirillova
Process in artificial intelligence and operations research
conditions that the variables must satisfy. A solution is therefore an assignment of values to the variables that satisfies all constraints—that is, a point
Constraint_satisfaction
Measure of the shape of a probability distribution function
expectation of a square, so it is non-negative for all a; however it is also a quadratic polynomial in a. Its discriminant must be non-positive, which gives the
Moment_(statistics)
American mathematician
and, as a Diophantine equation, the problem is to determine all rational solutions, i.e., assignments of rational numbers to the variables x, y
Jennifer_Balakrishnan
Mathematical formula expressing equality
letters at the beginning, a, b, c, d, ... . For example, the general quadratic equation is usually written ax2 + bx + c = 0. The process of finding the
Equation
Statistical approach
not been able to afford to fit a cubic three-level design to estimate a quadratic model, and their biased linear-models estimated the gradient to be zero
Response_surface_methodology
Natural number
his axioms to begin the sequence with 0. In the Von Neumann cardinal assignment of natural numbers, where each number is defined as a set that contains
1
Machine learning algorithm
simplifies the algorithm by not requiring the solution of a quadratic programming problem (see below). When used in a one-vs-all configuration, binary
Margin-infused relaxed algorithm
Margin-infused_relaxed_algorithm
Georgian Professor in the Ocean and Mechanical Engineering
With J. N. Reddy, Elishakoff has written on solving quadratic equations without resorting to quadratic formula. He also writes educational papers Elishakoff
Isaac_Elishakoff
Mathematically, this problem is: given A∈Rm×n, solve the quadratic optimization problem where A∈ℝm×n is given, and e=(1,…,1)′∈ℝm×1. The problem can be solved
K_q-flats
(disambiguation) Quadrat Quadrant count ratio Quadratic classifier Quadratic form (statistics) Quadratic variation Qualitative comparative analysis Qualitative
List_of_statistics_articles
Preference ranking
mathematical foundations of most common types of utility functions — quadratic and additive — laid down by Gérard Debreu enabled Andranik Tangian to
Ordinal_utility
Type of grammar for describing formal languages
asymptotically equivalent to boolean matrix multiplication (thus likely between quadratic and cubic time). One classical example of a formal language which is provably
Parsing_expression_grammar
Number taken as representative of a list of numbers
statistics that can be used as an average include the mid-range, the quadratic mean or the geometric mean, but they are rarely referred to as "the average"
Average
Real Two-dimensional Woodboard Cutting Problem" Area: Applications - Clémence Bisot. "Dynamic Linear Assignment for Pairing Two Parts in Production - A
ICORES
of any graph is at most quadratic in its maximum degree; they provide an example showing that for some graphs this quadratic dependence is necessary.
Thue_number
Indian mathematician (1887–1920)
summing divergent infinite series Ramanujan's constant Ramanujan's ternary quadratic form – Unique algebraic expression given by Srinivasa Ramanujan Rank of
Srinivasa_Ramanujan
Form of artificial neural network
conversion, job-shop scheduling problem, quadratic assignment and other related NP-complete problems, channel allocation problem in wireless networks, mobile
Hopfield_network
Automated recognition of patterns and regularities in data
predicting categorical labels. Parametric: Linear discriminant analysis Quadratic discriminant analysis Maximum entropy classifier (aka logistic regression
Pattern_recognition
Optimization algorithm
Nesterov (2010). In Nesterov's analysis the method needs to be applied to a quadratic perturbation of the original function with an unknown scaling factor.
Random_coordinate_descent
Method of result aggregation from multiple clustering algorithms
simplest heuristic, but its computational and storage complexity are both quadratic in n. SC3 is an example of a CSPA type algorithm. The following two methods
Consensus_clustering
Association of one output to each input
Functions can be classified by the nature of formulas that define them: A quadratic function is a function that may be written f(x)=ax2+bx+c, where a, b,
Function_(mathematics)
Greek-American electrical engineer (1942–2026)
algorithmic convergence issues around augmented Lagrangian and sequential quadratic programming methods. "Parallel and Distributed Computation: Numerical
Dimitri_Bertsekas
Optimization algorithms using quantum computing
exists: this gives the minimal solution to the SDP problem. Quantum SDP algorithms provide a generic quadratic improvement in certain oracle or query models
Quantum optimization algorithms
Quantum_optimization_algorithms
(elaborated below). Bipartite matching is achieved by solving the assignment problem, namely minimizing a sum of costs over all matched pairs. In the typical
Detection_Transformer
travel, tourism, insurance
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
QUADRATIC ASSIGNMENT-PROBLEM
travel, tourism, insurance