Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727): Difference between revisions

Latest revision as of 18:08, 20 July 2024

scientific article

Language	Label	Description	Also known as
English	Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems	scientific article

Statements

instance of

scholarly article

0 references

title

Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (English)

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

18 October 2019

0 references

full work available at URL

https://arxiv.org/abs/1802.00897

0 references

zbMATH Keywords

0-1 quadratic programming

0 references

experimental analysis of algorithms

0 references

set covering problem

0 references

equivalent formulations

0 references

combinatorial optimization

0 references

describes a project that uses

Gurobi

0 references

CPLEX

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q3989988

0 references

Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study

0 references

An algorithm for set covering problem

0 references

SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts

0 references

A characterization of linear admissible transformations for the m- travelling salesmen problem

0 references

Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

0 references

Exact quadratic convex reformulations of mixed-integer quadratically constrained problems

0 references

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

0 references

A New Lower Bound for the Quadratic Assignment Problem

0 references

Q4321552

0 references

The quadratic assignment problem. Theory and algorithms

0 references

The constant objective value property for multidimensional assignment problems

0 references

A characterization of linearizable instances of the quadratic minimum spanning tree problem

0 references

The bilinear assignment problem: complexity and polynomially solvable special cases

0 references

Approximation of the quadratic set covering problem

0 references

Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics

0 references

Q4775714

0 references

A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs

0 references

Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

0 references

Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs

0 references

Computational experience with approximation algorithms for the set covering problem

0 references

Solving Mixed Integer Bilinear Problems Using MILP Formulations

0 references

Q5613011

0 references

Q4889088

0 references

An O(n4) Algorithm for the QAP Linearization Problem

0 references

Weighted graphs with all Hamiltonian cycles of the same length

0 references

The unconstrained binary quadratic programming problem: a survey

0 references

The Quadratic Assignment Problem

0 references

Combinatorial optimization with interaction costs: complexity and solvable cases

0 references

Minimization and maximization versions of the quadratic travelling salesman problem

0 references

On a linearization technique for solving the quadratic set covering problem and variations

0 references

The quadratic knapsack problem -- a survey

0 references

A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming

0 references

The quadratic shortest path problem: complexity, approximability, and solution methods

0 references

Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation

0 references

An improved linearization strategy for zero-one quadratic programming problems

0 references

Identifiers

zbMATH Open document ID

1458.90503

0 references

DOI

10.1016/j.cor.2019.104769

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2329727

@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2968238625
@@ Property / OpenAlex ID: W2968238625 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00897
@@ Property / arXiv ID: 1802.00897 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3989988
@@ Property / cites work: Q3989988 / rank @@
+Normal rank
@@ Property / cites work @@
+Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
+Normal rank
@@ Property / cites work @@
+An algorithm for set covering problem
@@ Property / cites work: An algorithm for set covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts
+Normal rank
@@ Property / cites work @@
+A characterization of linear admissible transformations for the m- travelling salesmen problem
+Normal rank
@@ Property / cites work @@
+Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
+Normal rank
@@ Property / cites work @@
+Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
+Normal rank
@@ Property / cites work @@
+Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
+Normal rank
@@ Property / cites work @@
+A New Lower Bound for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Q4321552
@@ Property / cites work: Q4321552 / rank @@
+Normal rank
@@ Property / cites work @@
+The quadratic assignment problem. Theory and algorithms
+Normal rank
@@ Property / cites work @@
+The constant objective value property for multidimensional assignment problems
+Normal rank
@@ Property / cites work @@
+A characterization of linearizable instances of the quadratic minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+The bilinear assignment problem: complexity and polynomially solvable special cases
+Normal rank
@@ Property / cites work @@
+Approximation of the quadratic set covering problem
+Normal rank
@@ Property / cites work @@
+Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
+Normal rank
@@ Property / cites work @@
+Q4775714
@@ Property / cites work: Q4775714 / rank @@
+Normal rank
@@ Property / cites work @@
+A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs
+Normal rank
@@ Property / cites work @@
+Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
+Normal rank
@@ Property / cites work @@
+Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
+Normal rank
@@ Property / cites work @@
+Computational experience with approximation algorithms for the set covering problem
+Normal rank
@@ Property / cites work @@
+Solving Mixed Integer Bilinear Problems Using MILP Formulations
+Normal rank
@@ Property / cites work @@
+Q5613011
@@ Property / cites work: Q5613011 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4889088
@@ Property / cites work: Q4889088 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem
+Normal rank
@@ Property / cites work @@
+Weighted graphs with all Hamiltonian cycles of the same length
+Normal rank
@@ Property / cites work @@
+The unconstrained binary quadratic programming problem: a survey
+Normal rank
@@ Property / cites work @@
+The Quadratic Assignment Problem
@@ Property / cites work: The Quadratic Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization with interaction costs: complexity and solvable cases
+Normal rank
@@ Property / cites work @@
+Minimization and maximization versions of the quadratic travelling salesman problem
+Normal rank
@@ Property / cites work @@
+On a linearization technique for solving the quadratic set covering problem and variations
+Normal rank
@@ Property / cites work @@
+The quadratic knapsack problem -- a survey
@@ Property / cites work: The quadratic knapsack problem -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
+Normal rank
@@ Property / cites work @@
+The quadratic shortest path problem: complexity, approximability, and solution methods
+Normal rank
@@ Property / cites work @@
+Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation
+Normal rank
@@ Property / cites work @@
+An improved linearization strategy for zero-one quadratic programming problems
+Normal rank