The bilinear assignment problem: complexity and polynomially solvable special cases
In this paper we study the bilinear assignment problem (BAP) with size parameters m and n,
m ≤ nm≤ n. BAP is a generalization of the well known quadratic assignment problem and …
m ≤ nm≤ n. BAP is a generalization of the well known quadratic assignment problem and …
[HTML][HTML] Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
We consider domination analysis of approximation algorithms for the bipartite boolean
quadratic programming problem (BBQP) with m+ n variables. A closed-form formula is …
quadratic programming problem (BBQP) with m+ n variables. A closed-form formula is …
[PDF][PDF] Theory, algorithms and applications
Graph theory is a very popular area of discrete mathematics with not only numerous
theoretical developments, but also countless applications to practical problems. As a …
theoretical developments, but also countless applications to practical problems. As a …
Domination analysis of combinatorial optimization algorithms and problems
Domination Analysis of Combinatorial Optimization Algorithms and Problems Page 1 6
Domination Analysis of Combinatorial Optimization Algorithms and Problems Gregory Gutin …
Domination Analysis of Combinatorial Optimization Algorithms and Problems Gregory Gutin …
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
We study domination analysis of algorithms for the bipartite quadratic assignment problem.
A formula for the average objective function value of solutions is presented, whereas …
A formula for the average objective function value of solutions is presented, whereas …
Domination analysis of algorithms for bipartite boolean quadratic programs
For the bipartite boolean quadratic programming problem (BBQP) with m+ n variables, an O
(mn) algorithm is given to compute the average objective function value A of all solutions …
(mn) algorithm is given to compute the average objective function value A of all solutions …
Combinatorial dominance guarantees for heuristic algorithms
An f(n) dominancebound on a heuristic for some problem is a guarantee that the heuristic
always returns a solution not worse than at least f(n) solutions. In this paper, we analyze …
always returns a solution not worse than at least f(n) solutions. In this paper, we analyze …
Domination analysis of combinatorial optimization algorithms and problems
Domination analysis of combinatorial optimization algorithms and problems Page 150 6
Domination Analysis of Combinatorial Optimization Algorithms and Problems Gregory Gutin …
Domination Analysis of Combinatorial Optimization Algorithms and Problems Gregory Gutin …
[PDF][PDF] Introduction to domination analysis
In the recently published book on the Traveling Salesman Problem, half of Chapter 6 [18] is
devoted to domination analysis (DA) of heuristics for the Traveling Salesman Problem …
devoted to domination analysis (DA) of heuristics for the Traveling Salesman Problem …
Domination Analysis in Combinatorial Optimization
G Gutin - Encyclopedia of Optimization, 2024 - Springer
Exact algorithms allow one to find optimal solutions to NP-hard combinatorial optimization
(CO) problems. Many research papers report on solving large instances of some NP-hard …
(CO) problems. Many research papers report on solving large instances of some NP-hard …