Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
type: Item
instance of: scholarly article
title: Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
zbMATH Open document ID: 1003.90039
DOI: 10.1016/S0377-2217(01)00159-X
author: Marcelo Gonçalves Narciso
author: Luiz Antonio Nogueira Lorena
published in: European Journal of Operational Research
publication date: 2002-06-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 1756553
zbMATH Keywords: Held and Karp bound
zbMATH Keywords: surrogate relaxation
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: subgradient method
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: An adaptation of SH heuristic to the location set covering problem
cites work: A generalization of Polyak's convergence result for subgradient optimization
cites work: On the choice of step size in subgradient optimization
cites work: A generalized subgradient method with relaxation step
cites work: Q4133397
cites work: Convergence of some algorithms for convex minimization
cites work: Calculating surrogate constraints
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4178782
cites work: Surrogate Constraints
cites work: Surrogate Constraint Duality in Mathematical Programming
cites work: On convergence rates of subgradient optimization methods
cites work: Surrogate Mathematical Programming
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: Validation of subgradient optimization
cites work: Q4875205
cites work: Some relationships between lagrangian and surrogate duality in integer programming
cites work: Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
cites work: An improved subgradient method for constrained nondifferentiable optimization
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Conditional subgradient optimization -- theory and applications
cites work: Q3677509
cites work: A surrogate heuristic for set covering problems
cites work: Relaxation heuristics for a generalized assignment problem
cites work: Q4117605
cites work: Lagrangean/surrogate relaxation for generalized assignment problems
cites work: Q4040299
cites work: Minimization of unsmooth functionals
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: Generalized Lagrange Multipliers in Integer Programming
cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
cites work: Estimating the Held-Karp lower bound for the geometric TSP
full work available at URL: s0377-2217(01)00159-x
OpenAlex ID: W2046494104
description: scientific article; zbMATH DE number 1756553