Quadratic Combinatorial Optimization Using Separable Underestimators
From MaRDI portal
Publication:5136070
DOI10.1287/ijoc.2017.0789OpenAlexW2889336547WikidataQ129313828 ScholiaQ129313828MaRDI QIDQ5136070
Emiliano Traversi, Christoph Buchheim
Publication date: 25 November 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/286571e61669ea95869ab389da488c0286acc6d8
Related Items
Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, \(K\)-adaptability in stochastic combinatorial optimization under objective uncertainty, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, On Solving the Quadratic Shortest Path Problem, The linearization problem of a binary quadratic problem and its applications, Convex optimization under combinatorial sparsity constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An effective branch-and-bound algorithm for convex quadratic integer programming
- The quadratic knapsack problem -- a survey
- An algorithmic framework for convex mixed integer nonlinear programs
- The minimum reload \(s-t\) path, trail and walk problems
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- QAPLIB - a quadratic assignment problem library
- Semidefinite programming relaxations for the quadratic assignment problem
- A semidefinite programming approach to the quadratic knapsack problem
- Solving large quadratic assignment problems on computational grids
- Constrained 0-1 quadratic programming: basic approaches and extensions
- The Quadratic Assignment Problem
- Computational Approaches to Max-Cut
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Reload cost trees and network design
- On minimum reload cost paths, tours, and flows
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives
- Exact Solution of the Quadratic Knapsack Problem
- The Angular-Metric Traveling Salesman Problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
