Exact Solution of Two Location Problems via Branch-and-Bound

DOI10.1007/978-1-4419-7572-0_13zbMath1388.90069OpenAlexW2112057376MaRDI QIDQ5506728

Publication date: 16 December 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_13

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Cites Work

Copositive and semidefinite relaxations of the quadratic assignment problem
A survey for the quadratic assignment problem
A note on a polynomial time solvable case of the quadratic assignment problem
Bounds for the quadratic assignment problem using the bundle method
A level-2 reformulation-linearization technique bound for the quadratic assignment problem
On lower bounds for a class of quadratic 0,1 programs
Lower bounds for nonlinear assignment problems using many body interactions
Semidefinite programming relaxations for the quadratic assignment problem
Branch and peg algorithms for the simple plant location problem.
Lower bounds based on linear programming for the quadratic assignment problem
Branching rules revisited
A dual framework for lower bounds of the quadratic assignment problem based on linearization
Dynamic Version of the Economic Lot Size Model
The Quadratic Assignment Problem
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
Assignment Problems and the Location of Economic Activities
An Automatic Method of Solving Discrete Programming Problems
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
Totally-Balanced and Greedy Matrices
A Dual-Based Procedure for Uncapacitated Facility Location
A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
Cones of Matrices and Set-Functions and 0–1 Optimization
A New Lower Bound Via Projection for the Quadratic Assignment Problem
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
A Computational Study of Search Strategies for Mixed Integer Programming
Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
Specially Structured Uncapacitated Facility Location Problems
Rationalizing Tool Selection in a Flexible Manufacturing System for Sheet-Metal Products
Solving Lift-and-Project Relaxations of Binary Integer Programs
Branch-and-Bound Methods: A Survey
An Algorithm for the Traveling Salesman Problem
Tree-search algorithms for quadratic assignment problems
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem

This page was built for publication: Exact Solution of Two Location Problems via Branch-and-Bound