Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptation of SH heuristic to the location set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Polyak's convergence result for subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the choice of step size in subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized subgradient method with relaxation step / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some algorithms for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating surrogate constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence rates of subgradient optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved subgradient method for constrained nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional subgradient optimization -- theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation heuristics for a generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean/surrogate relaxation for generalized assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Lagrange Multipliers in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Held-Karp lower bound for the geometric TSP / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(01)00159-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046494104 / rank
 
Normal rank

Latest revision as of 10:51, 30 July 2024

scientific article
Language Label Description Also known as
English
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
scientific article

    Statements

    Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (English)
    0 references
    16 June 2002
    0 references
    Held and Karp bound
    0 references
    surrogate relaxation
    0 references
    traveling salesman problem
    0 references
    combinatorial optimization
    0 references
    Lagrangean relaxation
    0 references
    subgradient method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers