See this document in CiteSeerX!

An Application of Lagrangian Relaxation to the Traveling Salesman Problem (1999)  (Make Corrections)  
Susanne Timsjö



  Home/Search   Context   Related

 
View or download:
ima.mdh.se/tom/tom..._tom1999_02.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ima.mdh.se/tom/...chnical_reports (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The paper deals with the traveling salesman problem, i.e. the problem to nd the length of the shortest closed tour visiting a number of cities. The problem is formulated as an optimization problem. A solution strategy based on Lagrangian relaxation is presented. Applying Lagrangian relaxation will generate a convex, but non-smooth dual problem. For the solution of the dual problem a subgradient method is used. Heuristics are applied to modify the relaxed solution into a primal feasible one. An... (Update)

Active bibliography (related documents):   More   All
0.5:   Optimal Unit Commitment And Economic Dispatch Of.. - Dotzauer, Holmström.. (1999)   (Correct)
0.0:   OPERA TB 1.0 - A MATLAB Toolbox for Optimization Algorithms in.. - Holmström (1997)   (Correct)
0.0:   TOMLAB - A General Purpose, Open MATLAB Environment for Research .. - Holmström (1998)   (Correct)

Similar documents based on text:   More   All
0.2:   Lagrangian Decomposition for General Step Cost Single Path Network .. - Prytz   (Correct)
0.1:   Algorithms for Short-Term Production-Planning of Cogeneration.. - Dotzauer (1997)   (Correct)
0.1:   Ergodic Convergence In Subgradient Optimization - Larsson, Patriksson, Strömberg (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ timsj-application,
  author = "Susanne Timsj{\"o}",
  title = "An Application of Lagrangian Relaxation to the Traveling Salesman Problem",
  url = "citeseer.ist.psu.edu/367243.html" }
Citations (may not include all citations):
518   Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988  ACM
154   The Traveling Salesman Problem and Minimum Spanning Trees: P.. (context) - Held, Karp - 1971
86   Integer Programming (context) - Wolsey - 1998  ACM
30   An Applications Oriented Guide to Lagrangian Relaxation (context) - Fisher - 1985
2   Minimization Methods for Non-Dioeerentiable Functions (context) - Shor - 1985
1   Technical Report (context) - Reinelt - 1995

Documents on the same site (http://www.ima.mdh.se/tom/tom-prints/print-technical_reports.htm):   More
Identifying Parameters and Model Order for Two Classes of.. - Petersson, Holmström (1998)   (Correct)
Initial Values for a Class of Exponential Sum Least.. - Petersson, Holmström (1998)   (Correct)
Global Optimization Using the DIRECT Algorithm in Matlab - Björkman, Holmström (1999)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC