Exact solution of two location problems via branch-and-bound

DOI10.1007/978-1-4419-7572-0_13MaRDI QIDQ5506728zbMATH OpenOpenAlexFDO

Authors Timothy J. Lowe, Richard E. Wendell

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

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

Recommendations

• Branch-and-bound methods
• scientific article; zbMATH DE number 3908167
• About branch and bound method
• General branch and bound, and its relation to A^* and AO^*
• The many-commodity location problem (the branch-and-bound method)

Cites work

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

Cited in

(2)

• The log bucking problem: A comparison of dynamic programming versus branch and bound
• General branch and bound, and its relation to A^* and AO^*

This page was built for publication: Exact solution of two location problems via branch-and-bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506728)