Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
type: Item
instance of: scholarly article
title: Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
zbMATH Open document ID: 0855.90087
DOI: 10.1016/0167-6377(95)00038-0
author: Agha Iqbal Ali
author: Shirley Shmerling
published in: Operations Research Letters
publication date: 1997-02-11T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 912531
zbMATH Keywords: spanning trees
zbMATH Keywords: routing
zbMATH Keywords: travelling salesman
zbMATH Keywords: Hamiltonian paths
zbMATH Keywords: facet-inducing inequalities
zbMATH Keywords: graphical-construct-based Lagrangian relaxation
zbMATH Keywords: duality gaps
MaRDI profile type: Publication
full work available at URL: 0167-6377(95)00038-0
OpenAlex ID: W2014514762
cites work: Graphical-structure-based models for routing problems
cites work: The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
cites work: Optimizing over the subtour polytope of the travelling salesman problem
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
cites work: A new class of cutting planes for the symmetric travelling salesman problem
cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem
cites work: A cutting plane algorithm for minimum perfect 2-matchings
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: Q3714900
cites work: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
cites work: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3714901
cites work: On the symmetric travelling salesman problem: A computational study
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
description: scientific article; zbMATH DE number 912531