On global integer extrema of real-valued box-constrained multivariate quadratic functions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 724211
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set
- On nonconvex quadratic programming with box constraints
- scientific article; zbMATH DE number 221928
- Global optimization techniques for solving the general quadratic integer programming problem
Cites work
- 8/7-approximation algorithm for (1,2)-TSP
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Dynamic Programming Approach to Sequencing Problems
- A Multilevel Approach to the Travelling Salesman Problem
- A note on two problems in connexion with graphs
- Algebra.
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Better approximations for max TSP
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Extrema of a real polynomial
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3156818 (Why is no real title available?)
- scientific article; zbMATH DE number 910849 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3260031 (Why is no real title available?)
- scientific article; zbMATH DE number 3383473 (Why is no real title available?)
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Multivariate polynomial minimization and its application in signal processing
- New Bounds for the Traveling Salesman Constant
- New inapproximability bounds for TSP
- Nondifferentiable optimization and polynomial problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Solution of a Large-Scale Traveling-Salesman Problem
- The Euclidean traveling salesman problem is NP-complete
- The traveling salesman problem. A computational study.
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- Worst-case analysis of a new heuristic for the travelling salesman problem
This page was built for publication: On global integer extrema of real-valued box-constrained multivariate quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680502)
