Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem-Reference-Cited by-同舟云学术

Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem

Published:2010-02 Issue:1 Volume:201 Page:82-88
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Zamani Reza,Lau Sim Kim

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference26 articles.

1. The Traveling Salesman Problem: A Computational Study;Applegate,2006

2. Accelerating the convergence of subgradient optimisation;Baker;European Journal of Operational Research,1999

3. New lower bounds for the symmetric traveling salesman problems;Carpeneto;Mathematical Programming,1989

4. Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem;Christofides,1976

5. An application oriented guide to Lagrangian relaxation;Fisher;Interfaces,1985

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallelized Decomposition Approaches to Solve the Capacitated Lot-Sizing Problem with Setup Times and Constraints on Ending Inventories;SSRN Electronic Journal;2022

2. Parallelized Decomposition Approaches to Solve the Capacitated Lot-Sizing Problem with Setup Times and Constraints on Ending Inventories;SSRN Electronic Journal;2022

3. SYMMETRIC TRAVELING SALESMAN PROBLEM AND FLOWS IN HYPERGRAPHS: NEW ALGORITHMIC POSSIBILITIES;ATTI ACCAD PELORIT;2019

4. An evolutionary implicit enumeration procedure for solving the resource-constrained project scheduling problem;International Transactions in Operational Research;2015-07-30

5. Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory;OR Spectrum;2015-06-10